./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.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-s_file-19.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 c3a2d291e2452542ab6962635da2f74c802677a527b9a558cac3248bce42ee2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:36:34,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:36:34,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:36:34,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:36:34,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:36:34,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:36:34,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:36:34,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:36:34,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:36:34,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:36:34,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:36:34,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:36:34,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:36:34,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:36:34,157 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:36:34,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:36:34,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:36:34,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:36:34,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:36:34,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:36:34,159 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 -> c3a2d291e2452542ab6962635da2f74c802677a527b9a558cac3248bce42ee2c [2025-03-04 01:36:34,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:36:34,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:36:34,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:36:34,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:36:34,400 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:36:34,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2025-03-04 01:36:35,516 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18c8ac05/e8c9408473374d19b13df45f4d4a8251/FLAGd4ee6275e [2025-03-04 01:36:35,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:36:35,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2025-03-04 01:36:35,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18c8ac05/e8c9408473374d19b13df45f4d4a8251/FLAGd4ee6275e [2025-03-04 01:36:36,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18c8ac05/e8c9408473374d19b13df45f4d4a8251 [2025-03-04 01:36:36,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:36:36,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:36:36,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:36:36,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:36:36,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:36:36,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36, skipping insertion in model container [2025-03-04 01:36:36,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:36:36,203 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-s_file-19.i[916,929] [2025-03-04 01:36:36,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:36:36,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:36:36,247 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-s_file-19.i[916,929] [2025-03-04 01:36:36,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:36:36,306 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:36:36,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36 WrapperNode [2025-03-04 01:36:36,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:36:36,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:36:36,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:36:36,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:36:36,312 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:36:36" (1/1) ... [2025-03-04 01:36:36,319 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:36:36" (1/1) ... [2025-03-04 01:36:36,341 INFO L138 Inliner]: procedures = 27, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2025-03-04 01:36:36,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:36:36,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:36:36,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:36:36,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:36:36,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,367 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-03-04 01:36:36,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:36:36,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:36:36,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:36:36,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:36:36,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (1/1) ... [2025-03-04 01:36:36,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:36:36,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:36:36,418 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:36:36,420 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:36:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:36:36,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:36:36,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:36:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:36:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:36:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:36:36,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:36:36,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:36:36,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:36:36,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~bitwise74#1;havoc property_#t~mem75#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite109#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-04 01:36:36,861 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 01:36:36,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:36:36,872 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:36:36,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:36:36,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:36:36 BoogieIcfgContainer [2025-03-04 01:36:36,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:36:36,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:36:36,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:36:36,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:36:36,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:36:36" (1/3) ... [2025-03-04 01:36:36,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17393449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:36:36, skipping insertion in model container [2025-03-04 01:36:36,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:36:36" (2/3) ... [2025-03-04 01:36:36,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17393449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:36:36, skipping insertion in model container [2025-03-04 01:36:36,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:36:36" (3/3) ... [2025-03-04 01:36:36,880 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-19.i [2025-03-04 01:36:36,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:36:36,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-19.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:36:36,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:36:36,945 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;@5817ac51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:36:36,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:36:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:36:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:36:36,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:36,961 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:36,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 793708769, now seen corresponding path program 1 times [2025-03-04 01:36:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:36,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831834239] [2025-03-04 01:36:36,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:36,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:37,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:36:37,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:36:37,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:36:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:37,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831834239] [2025-03-04 01:36:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831834239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:36:37,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142778] [2025-03-04 01:36:37,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:36:37,252 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:36:37,254 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:36:37,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:36:37,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:36:37,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:37,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:37,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:36:37,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:36:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:36:37,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:36:37,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:37,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:36:37,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:36:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565787308] [2025-03-04 01:36:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:36:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:37,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:36:37,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:36:37,455 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:36:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:37,480 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-03-04 01:36:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:36:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-04 01:36:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:37,487 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:36:37,487 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:36:37,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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:36:37,492 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:37,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:36:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:36:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:36:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:36:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-03-04 01:36:37,532 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2025-03-04 01:36:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:37,533 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-03-04 01:36:37,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:36:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-03-04 01:36:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:36:37,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:37,536 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:36:37,736 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:36:37,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash -613404814, now seen corresponding path program 1 times [2025-03-04 01:36:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:37,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076101112] [2025-03-04 01:36:37,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:37,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:37,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:36:37,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:36:37,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:37,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:38,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076101112] [2025-03-04 01:36:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076101112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:38,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:36:38,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:36:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741762886] [2025-03-04 01:36:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:38,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:36:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:38,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:36:38,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:36:38,028 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:38,072 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-03-04 01:36:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:36:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:36:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:38,075 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:36:38,076 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:36:38,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:36:38,078 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:38,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:36:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:36:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:36:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:36:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-03-04 01:36:38,092 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2025-03-04 01:36:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:38,093 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-03-04 01:36:38,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-03-04 01:36:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:36:38,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:38,096 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:36:38,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:38,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash -612481293, now seen corresponding path program 1 times [2025-03-04 01:36:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826737835] [2025-03-04 01:36:38,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:38,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:36:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:36:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:38,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-04 01:36:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826737835] [2025-03-04 01:36:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826737835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:36:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693594708] [2025-03-04 01:36:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:40,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:36:40,780 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:36:40,781 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:36:40,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:36:40,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:36:40,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:40,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:40,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:36:40,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:36:40,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 93 [2025-03-04 01:36:40,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2025-03-04 01:36:41,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2025-03-04 01:36:41,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:41,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 115 [2025-03-04 01:36:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:36:41,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:36:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693594708] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:36:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:36:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15, 8] total 18 [2025-03-04 01:36:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356783387] [2025-03-04 01:36:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:41,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:36:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:41,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:36:41,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:36:41,462 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:41,760 INFO L93 Difference]: Finished difference Result 258 states and 361 transitions. [2025-03-04 01:36:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:36:41,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:36:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:41,762 INFO L225 Difference]: With dead ends: 258 [2025-03-04 01:36:41,762 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 01:36:41,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:36:41,767 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 67 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:41,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 638 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:36:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 01:36:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-03-04 01:36:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 133 states have internal predecessors, (173), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:36:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 219 transitions. [2025-03-04 01:36:41,778 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 219 transitions. Word has length 132 [2025-03-04 01:36:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:41,779 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 219 transitions. [2025-03-04 01:36:41,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 219 transitions. [2025-03-04 01:36:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:36:41,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:41,781 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:36:41,981 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,SelfDestructingSolverStorable2 [2025-03-04 01:36:41,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:41,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash 740828404, now seen corresponding path program 1 times [2025-03-04 01:36:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574789496] [2025-03-04 01:36:41,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:36:42,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:36:42,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:42,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574789496] [2025-03-04 01:36:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574789496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:42,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:36:42,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:36:42,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828009183] [2025-03-04 01:36:42,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:42,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:36:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:42,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:36:42,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:36:42,171 INFO L87 Difference]: Start difference. First operand 158 states and 219 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:42,429 INFO L93 Difference]: Finished difference Result 383 states and 530 transitions. [2025-03-04 01:36:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:36:42,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:36:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:42,432 INFO L225 Difference]: With dead ends: 383 [2025-03-04 01:36:42,432 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 01:36:42,433 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:36:42,433 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 80 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:42,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 538 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:36:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 01:36:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2025-03-04 01:36:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 186 states have (on average 1.2956989247311828) internal successors, (241), 188 states have internal predecessors, (241), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 01:36:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2025-03-04 01:36:42,457 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 132 [2025-03-04 01:36:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:42,458 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2025-03-04 01:36:42,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2025-03-04 01:36:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:36:42,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:42,460 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:36:42,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:42,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -888416977, now seen corresponding path program 1 times [2025-03-04 01:36:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875860471] [2025-03-04 01:36:42,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:42,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:36:42,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:36:42,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:42,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:44,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875860471] [2025-03-04 01:36:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875860471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:44,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:36:44,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:36:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710882238] [2025-03-04 01:36:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:44,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:36:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:44,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:36:44,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:36:44,032 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:36:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:44,479 INFO L93 Difference]: Finished difference Result 519 states and 713 transitions. [2025-03-04 01:36:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:36:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 133 [2025-03-04 01:36:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:44,482 INFO L225 Difference]: With dead ends: 519 [2025-03-04 01:36:44,482 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 01:36:44,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:36:44,483 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:44,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 776 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:36:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 01:36:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2025-03-04 01:36:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 198 states have (on average 1.297979797979798) internal successors, (257), 200 states have internal predecessors, (257), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 01:36:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 327 transitions. [2025-03-04 01:36:44,498 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 327 transitions. Word has length 133 [2025-03-04 01:36:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:44,498 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 327 transitions. [2025-03-04 01:36:44,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:36:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 327 transitions. [2025-03-04 01:36:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:36:44,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:44,499 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:36:44,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1048885230, now seen corresponding path program 1 times [2025-03-04 01:36:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473716744] [2025-03-04 01:36:44,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:44,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:36:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:36:44,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:44,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:45,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473716744] [2025-03-04 01:36:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473716744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:45,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:36:45,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:36:45,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720700346] [2025-03-04 01:36:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:45,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:36:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:45,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:36:45,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:36:45,694 INFO L87 Difference]: Start difference. First operand 237 states and 327 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:36:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:46,308 INFO L93 Difference]: Finished difference Result 582 states and 800 transitions. [2025-03-04 01:36:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:36:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-04 01:36:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:46,311 INFO L225 Difference]: With dead ends: 582 [2025-03-04 01:36:46,312 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 01:36:46,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:36:46,314 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 67 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:46,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 896 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:36:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 01:36:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 258. [2025-03-04 01:36:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 221 states have internal predecessors, (285), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 01:36:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2025-03-04 01:36:46,339 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 134 [2025-03-04 01:36:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:46,340 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2025-03-04 01:36:46,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:36:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2025-03-04 01:36:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:36:46,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:46,341 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:36:46,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:46,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1882623348, now seen corresponding path program 1 times [2025-03-04 01:36:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:46,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792939364] [2025-03-04 01:36:46,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:46,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:36:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:36:46,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792939364] [2025-03-04 01:36:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792939364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:36:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:36:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615321059] [2025-03-04 01:36:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:36:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:47,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:36:47,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:36:47,779 INFO L87 Difference]: Start difference. First operand 258 states and 355 transitions. Second operand has 10 states, 6 states have (on average 8.666666666666666) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:36:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:48,287 INFO L93 Difference]: Finished difference Result 613 states and 841 transitions. [2025-03-04 01:36:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:36:48,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 6 states have (on average 8.666666666666666) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) Word has length 134 [2025-03-04 01:36:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:48,289 INFO L225 Difference]: With dead ends: 613 [2025-03-04 01:36:48,290 INFO L226 Difference]: Without dead ends: 358 [2025-03-04 01:36:48,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:36:48,290 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 61 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:48,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 837 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:36:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-04 01:36:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 254. [2025-03-04 01:36:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 215 states have (on average 1.2930232558139534) internal successors, (278), 217 states have internal predecessors, (278), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 01:36:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 348 transitions. [2025-03-04 01:36:48,307 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 348 transitions. Word has length 134 [2025-03-04 01:36:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:48,308 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 348 transitions. [2025-03-04 01:36:48,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 6 states have (on average 8.666666666666666) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:36:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 348 transitions. [2025-03-04 01:36:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:36:48,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:48,309 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:36:48,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1532037136, now seen corresponding path program 1 times [2025-03-04 01:36:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608448727] [2025-03-04 01:36:48,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:48,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:48,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:48,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:36:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608448727] [2025-03-04 01:36:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608448727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:36:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833228679] [2025-03-04 01:36:48,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:48,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:36:48,633 INFO L229 MonitoredProcess]: Starting monitored process 4 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:36:48,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:36:48,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:48,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:48,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:48,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:48,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:36:48,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:36:48,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:36:48,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:36:48,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:48,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 35 [2025-03-04 01:36:48,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 56 [2025-03-04 01:36:48,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:48,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 61 [2025-03-04 01:36:48,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 79 [2025-03-04 01:36:48,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 133 [2025-03-04 01:36:49,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 64 [2025-03-04 01:36:49,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:49,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 159 treesize of output 53 [2025-03-04 01:36:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-04 01:36:49,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:36:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:36:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833228679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:36:49,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:36:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2025-03-04 01:36:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034148505] [2025-03-04 01:36:49,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:36:49,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:36:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:49,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:36:49,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:36:49,438 INFO L87 Difference]: Start difference. First operand 254 states and 348 transitions. Second operand has 15 states, 12 states have (on average 7.166666666666667) internal successors, (86), 15 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-04 01:36:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:50,281 INFO L93 Difference]: Finished difference Result 716 states and 963 transitions. [2025-03-04 01:36:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 01:36:50,284 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.166666666666667) internal successors, (86), 15 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 135 [2025-03-04 01:36:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:50,286 INFO L225 Difference]: With dead ends: 716 [2025-03-04 01:36:50,286 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 01:36:50,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 260 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:36:50,287 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 608 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:50,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 407 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:36:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 01:36:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 446. [2025-03-04 01:36:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 396 states have (on average 1.2853535353535352) internal successors, (509), 401 states have internal predecessors, (509), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:36:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 591 transitions. [2025-03-04 01:36:50,322 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 591 transitions. Word has length 135 [2025-03-04 01:36:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 591 transitions. [2025-03-04 01:36:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.166666666666667) internal successors, (86), 15 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-04 01:36:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 591 transitions. [2025-03-04 01:36:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:36:50,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:50,323 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:50,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:36:50,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:50,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:50,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2060702928, now seen corresponding path program 1 times [2025-03-04 01:36:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569165910] [2025-03-04 01:36:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:50,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:50,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:50,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:50,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-04 01:36:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569165910] [2025-03-04 01:36:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569165910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:36:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857561513] [2025-03-04 01:36:52,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:52,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:36:52,586 INFO L229 MonitoredProcess]: Starting monitored process 5 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:36:52,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:36:52,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:52,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:52,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:52,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 01:36:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:36:52,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:36:52,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:36:52,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:36:52,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:36:52,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:36:52,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:36:52,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:52,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-04 01:36:52,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:52,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2025-03-04 01:36:52,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:52,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 56 [2025-03-04 01:36:52,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 123 [2025-03-04 01:36:52,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:52,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 167 [2025-03-04 01:36:53,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2025-03-04 01:36:53,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:53,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 154 treesize of output 52 [2025-03-04 01:36:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:36:53,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:36:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:53,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857561513] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:36:53,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:36:53,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [24, 12] total 34 [2025-03-04 01:36:53,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491942559] [2025-03-04 01:36:53,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:53,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:36:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:53,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:36:53,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:36:53,632 INFO L87 Difference]: Start difference. First operand 446 states and 591 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:54,071 INFO L93 Difference]: Finished difference Result 1010 states and 1333 transitions. [2025-03-04 01:36:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:36:54,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-04 01:36:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:54,075 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 01:36:54,076 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 01:36:54,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:36:54,079 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 68 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:54,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 787 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:36:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 01:36:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 560. [2025-03-04 01:36:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 502 states have (on average 1.2808764940239044) internal successors, (643), 509 states have internal predecessors, (643), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 40 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:36:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 737 transitions. [2025-03-04 01:36:54,115 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 737 transitions. Word has length 135 [2025-03-04 01:36:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:54,119 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 737 transitions. [2025-03-04 01:36:54,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:36:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 737 transitions. [2025-03-04 01:36:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:36:54,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:54,120 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:36:54,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:54,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1780661665, now seen corresponding path program 1 times [2025-03-04 01:36:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079321579] [2025-03-04 01:36:54,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:54,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:54,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:54,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:36:55,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:36:55,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079321579] [2025-03-04 01:36:55,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079321579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:36:55,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:36:55,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:36:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520849364] [2025-03-04 01:36:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:36:55,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:36:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:36:55,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:36:55,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:36:55,369 INFO L87 Difference]: Start difference. First operand 560 states and 737 transitions. Second operand has 9 states, 5 states have (on average 10.6) internal successors, (53), 9 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:36:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:36:55,768 INFO L93 Difference]: Finished difference Result 1357 states and 1788 transitions. [2025-03-04 01:36:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:36:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 10.6) internal successors, (53), 9 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) Word has length 135 [2025-03-04 01:36:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:36:55,772 INFO L225 Difference]: With dead ends: 1357 [2025-03-04 01:36:55,772 INFO L226 Difference]: Without dead ends: 790 [2025-03-04 01:36:55,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:36:55,774 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 54 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:36:55,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 669 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:36:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-04 01:36:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 546. [2025-03-04 01:36:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 488 states have (on average 1.264344262295082) internal successors, (617), 495 states have internal predecessors, (617), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 40 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:36:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 711 transitions. [2025-03-04 01:36:55,805 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 711 transitions. Word has length 135 [2025-03-04 01:36:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:36:55,806 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 711 transitions. [2025-03-04 01:36:55,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 10.6) internal successors, (53), 9 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:36:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 711 transitions. [2025-03-04 01:36:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:36:55,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:36:55,807 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:55,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:36:55,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:36:55,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:36:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1796546085, now seen corresponding path program 1 times [2025-03-04 01:36:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:36:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139260099] [2025-03-04 01:36:55,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:36:55,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:55,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:55,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:55,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:36:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109644396] [2025-03-04 01:36:55,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:36:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:36:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:36:55,863 INFO L229 MonitoredProcess]: Starting monitored process 6 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:36:55,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:36:55,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:36:56,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:36:56,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:36:56,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:36:56,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-04 01:36:56,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:36:56,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2025-03-04 01:36:56,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 103 [2025-03-04 01:36:56,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:36:57,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:57,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2025-03-04 01:36:57,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:57,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-04 01:36:57,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:57,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-04 01:36:57,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2025-03-04 01:36:57,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:57,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2025-03-04 01:36:57,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:57,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2025-03-04 01:36:58,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:58,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 93 [2025-03-04 01:36:58,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 109 [2025-03-04 01:36:58,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:58,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 187 treesize of output 132 [2025-03-04 01:36:59,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 197 [2025-03-04 01:36:59,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:36:59,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 197 treesize of output 249 [2025-03-04 01:36:59,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 166 [2025-03-04 01:37:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 345 proven. 102 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 01:37:04,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:37:13,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:13,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139260099] [2025-03-04 01:37:13,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:37:13,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109644396] [2025-03-04 01:37:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109644396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:37:13,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:37:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2025-03-04 01:37:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562819668] [2025-03-04 01:37:13,549 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:37:13,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 01:37:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:13,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 01:37:13,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2075, Unknown=1, NotChecked=0, Total=2450 [2025-03-04 01:37:13,551 INFO L87 Difference]: Start difference. First operand 546 states and 711 transitions. Second operand has 33 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 32 states have internal predecessors, (74), 8 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 01:37:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:29,391 INFO L93 Difference]: Finished difference Result 2016 states and 2588 transitions. [2025-03-04 01:37:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 01:37:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 32 states have internal predecessors, (74), 8 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) Word has length 135 [2025-03-04 01:37:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:29,398 INFO L225 Difference]: With dead ends: 2016 [2025-03-04 01:37:29,399 INFO L226 Difference]: Without dead ends: 1473 [2025-03-04 01:37:29,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=838, Invalid=4417, Unknown=1, NotChecked=0, Total=5256 [2025-03-04 01:37:29,402 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 545 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:29,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1274 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2025-03-04 01:37:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-04 01:37:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 858. [2025-03-04 01:37:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 747 states have (on average 1.2423025435073627) internal successors, (928), 757 states have internal predecessors, (928), 82 states have call successors, (82), 28 states have call predecessors, (82), 28 states have return successors, (82), 72 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-04 01:37:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1092 transitions. [2025-03-04 01:37:29,446 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1092 transitions. Word has length 135 [2025-03-04 01:37:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:29,447 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1092 transitions. [2025-03-04 01:37:29,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 32 states have internal predecessors, (74), 8 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 01:37:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1092 transitions. [2025-03-04 01:37:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:37:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:29,450 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:37:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 01:37:29,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:29,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 952074214, now seen corresponding path program 1 times [2025-03-04 01:37:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138076784] [2025-03-04 01:37:29,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:29,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:37:29,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:37:29,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:29,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:37:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832607325] [2025-03-04 01:37:29,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:37:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:29,706 INFO L229 MonitoredProcess]: Starting monitored process 7 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:37:29,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:37:29,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:37:30,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:37:30,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:30,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:30,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-04 01:37:30,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:37:30,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2025-03-04 01:37:30,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 107 [2025-03-04 01:37:30,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:37:30,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:30,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2025-03-04 01:37:31,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:31,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-04 01:37:31,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:31,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-04 01:37:31,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2025-03-04 01:37:31,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:31,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2025-03-04 01:37:31,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:31,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2025-03-04 01:37:32,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:32,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 93 [2025-03-04 01:37:32,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2025-03-04 01:37:32,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:32,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 178 treesize of output 138 [2025-03-04 01:37:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 312 proven. 135 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 01:37:39,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:37:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138076784] [2025-03-04 01:37:41,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:37:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832607325] [2025-03-04 01:37:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832607325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:37:41,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:37:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2025-03-04 01:37:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350685096] [2025-03-04 01:37:41,406 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:37:41,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 01:37:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:41,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 01:37:41,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1713, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 01:37:41,408 INFO L87 Difference]: Start difference. First operand 858 states and 1092 transitions. Second operand has 32 states, 28 states have (on average 2.642857142857143) internal successors, (74), 31 states have internal predecessors, (74), 8 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 01:37:53,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:37:58,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:38:02,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]