./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_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-sp_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 a696e6551ad1205554c4678998c1625e3c8a3a93c97ae7f8e7897edb0d3d5ceb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:47:45,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:47:45,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:47:45,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:47:45,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:47:45,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:47:45,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:47:45,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:47:45,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:47:45,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:47:45,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:47:45,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:47:45,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:47:45,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:47:45,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:47:45,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:47:45,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:47:45,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:47:45,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:47:45,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:47:45,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:47:45,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:47:45,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:47:45,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:47:45,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:47:45,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:47:45,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:45,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:47:45,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:47:45,240 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 -> a696e6551ad1205554c4678998c1625e3c8a3a93c97ae7f8e7897edb0d3d5ceb [2025-03-04 01:47:45,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:47:45,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:47:45,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:47:45,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:47:45,487 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:47:45,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-19.i [2025-03-04 01:47:46,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0049a55/8604c696896847bbb4c0a80fddd552f6/FLAG45981e9a0 [2025-03-04 01:47:46,831 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:47:46,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-19.i [2025-03-04 01:47:46,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0049a55/8604c696896847bbb4c0a80fddd552f6/FLAG45981e9a0 [2025-03-04 01:47:46,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0049a55/8604c696896847bbb4c0a80fddd552f6 [2025-03-04 01:47:46,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:47:46,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:47:46,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:46,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:47:46,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:47:46,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:46" (1/1) ... [2025-03-04 01:47:46,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756e6a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:46, skipping insertion in model container [2025-03-04 01:47:46,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:46" (1/1) ... [2025-03-04 01:47:46,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:47:46,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-19.i[917,930] [2025-03-04 01:47:47,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:47,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:47:47,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-19.i[917,930] [2025-03-04 01:47:47,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:47,117 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:47:47,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47 WrapperNode [2025-03-04 01:47:47,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:47,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:47,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:47:47,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:47:47,128 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:47:47" (1/1) ... [2025-03-04 01:47:47,141 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:47:47" (1/1) ... [2025-03-04 01:47:47,172 INFO L138 Inliner]: procedures = 27, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2025-03-04 01:47:47,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:47,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:47:47,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:47:47,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:47:47,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,196 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:47:47,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:47:47,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:47:47,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:47:47,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:47:47,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (1/1) ... [2025-03-04 01:47:47,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:47,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:47,243 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:47:47,248 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:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:47:47,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:47:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:47:47,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:47:47,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:47:47,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:47:47,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: 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:47:47,748 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 01:47:47,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:47:47,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:47:47,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:47:47,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:47 BoogieIcfgContainer [2025-03-04 01:47:47,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:47:47,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:47:47,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:47:47,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:47:47,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:47:46" (1/3) ... [2025-03-04 01:47:47,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@873c9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:47, skipping insertion in model container [2025-03-04 01:47:47,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:47" (2/3) ... [2025-03-04 01:47:47,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@873c9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:47, skipping insertion in model container [2025-03-04 01:47:47,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:47" (3/3) ... [2025-03-04 01:47:47,773 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-19.i [2025-03-04 01:47:47,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:47:47,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-19.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:47:47,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:47:47,836 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;@8cbb7f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:47:47,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:47:47,841 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:47:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:47:47,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:47,852 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:47:47,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash 793708769, now seen corresponding path program 1 times [2025-03-04 01:47:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056533326] [2025-03-04 01:47:47,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:47,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:47:47,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:47:47,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:48,105 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:47:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056533326] [2025-03-04 01:47:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056533326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084050428] [2025-03-04 01:47:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:48,111 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:47:48,112 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:47:48,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:47:48,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:47:48,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:48,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:48,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:47:48,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:48,323 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:47:48,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084050428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:47:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:47:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556730741] [2025-03-04 01:47:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:47:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:48,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:47:48,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:48,350 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:47:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:48,377 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-03-04 01:47:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:47:48,383 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:47:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:48,401 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:47:48,402 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:47:48,404 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:47:48,406 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:47:48,407 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:47:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:47:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:47:48,430 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:47:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-03-04 01:47:48,435 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2025-03-04 01:47:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:48,435 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-03-04 01:47:48,436 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:47:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-03-04 01:47:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:47:48,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:48,440 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:47:48,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:47:48,640 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:47:48,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:48,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash -613404814, now seen corresponding path program 1 times [2025-03-04 01:47:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:48,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510672787] [2025-03-04 01:47:48,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:47:48,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:47:48,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:48,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:48,914 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:47:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510672787] [2025-03-04 01:47:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510672787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:47:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626194995] [2025-03-04 01:47:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:48,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:47:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:48,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:47:48,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:47:48,916 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:47:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:48,956 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-03-04 01:47:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:47:48,958 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:47:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:48,960 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:47:48,960 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:47:48,960 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:47:48,961 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:47:48,961 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:47:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:47:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:47:48,977 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:47:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-03-04 01:47:48,981 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2025-03-04 01:47:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:48,983 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-03-04 01:47:48,983 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:47:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-03-04 01:47:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:47:48,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:48,984 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:47:48,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:47:48,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:48,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash -612481293, now seen corresponding path program 1 times [2025-03-04 01:47:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826987958] [2025-03-04 01:47:48,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:49,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:47:49,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:47:49,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:49,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:47:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826987958] [2025-03-04 01:47:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826987958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903742820] [2025-03-04 01:47:51,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:51,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:51,837 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:47:51,839 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:47:51,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:47:52,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:47:52,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:52,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-04 01:47:52,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:53,486 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 15 treesize of output 1 [2025-03-04 01:47:53,781 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 15 treesize of output 1 [2025-03-04 01:47:54,092 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 15 treesize of output 1 [2025-03-04 01:47:54,407 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 15 treesize of output 1 [2025-03-04 01:47:54,691 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 15 treesize of output 1 [2025-03-04 01:47:55,092 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 15 treesize of output 1 [2025-03-04 01:47:55,153 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-04 01:47:55,153 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 01:47:55,240 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2025-03-04 01:47:55,241 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 3 case distinctions, treesize of input 27 treesize of output 25 [2025-03-04 01:47:55,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,390 INFO L349 Elim1Store]: treesize reduction 65, result has 18.8 percent of original size [2025-03-04 01:47:55,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 76 [2025-03-04 01:47:55,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:47:55,677 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:47:55,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 118 [2025-03-04 01:47:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 204 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-04 01:47:55,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:47:55,963 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:47:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903742820] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:55,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:47:55,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20, 12] total 33 [2025-03-04 01:47:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268608881] [2025-03-04 01:47:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:47:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:55,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:47:55,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:47:55,965 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:47:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:56,278 INFO L93 Difference]: Finished difference Result 242 states and 340 transitions. [2025-03-04 01:47:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:47:56,278 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:47:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:56,279 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:47:56,279 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:47:56,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:47:56,281 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:56,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 578 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:47:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2025-03-04 01:47:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 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:47:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2025-03-04 01:47:56,296 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 132 [2025-03-04 01:47:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:56,296 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2025-03-04 01:47:56,296 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:47:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2025-03-04 01:47:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:47:56,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:56,298 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:47:56,306 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:47:56,498 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:47:56,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash 740828404, now seen corresponding path program 1 times [2025-03-04 01:47:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799058961] [2025-03-04 01:47:56,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:47:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:47:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:56,706 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:47:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799058961] [2025-03-04 01:47:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799058961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:56,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:47:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435005522] [2025-03-04 01:47:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:56,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:47:56,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:56,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:47:56,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:47:56,709 INFO L87 Difference]: Start difference. First operand 109 states and 153 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:47:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:56,870 INFO L93 Difference]: Finished difference Result 257 states and 359 transitions. [2025-03-04 01:47:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:47:56,870 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:47:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:56,871 INFO L225 Difference]: With dead ends: 257 [2025-03-04 01:47:56,871 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:47:56,872 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:47:56,872 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 47 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:56,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 481 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:47:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:47:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2025-03-04 01:47:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 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:47:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-03-04 01:47:56,879 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 132 [2025-03-04 01:47:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:56,879 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-03-04 01:47:56,879 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:47:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-03-04 01:47:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:47:56,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:56,881 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:47:56,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:47:56,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:56,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash -888416977, now seen corresponding path program 1 times [2025-03-04 01:47:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547032097] [2025-03-04 01:47:56,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:47:56,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:47:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:58,945 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:47:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547032097] [2025-03-04 01:47:58,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547032097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:58,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:58,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:47:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535847850] [2025-03-04 01:47:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:58,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:47:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:58,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:47:58,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:47:58,949 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:48:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:00,088 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2025-03-04 01:48:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:48:00,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-03-04 01:48:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:00,089 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:48:00,089 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 01:48:00,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:48:00,090 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 223 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:00,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 459 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:48:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 01:48:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2025-03-04 01:48:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 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:48:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2025-03-04 01:48:00,109 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 133 [2025-03-04 01:48:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2025-03-04 01:48:00,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:48:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2025-03-04 01:48:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:48:00,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:00,114 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:48:00,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:48:00,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:00,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1048885230, now seen corresponding path program 1 times [2025-03-04 01:48:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:00,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113114287] [2025-03-04 01:48:00,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:00,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:48:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:48:00,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:00,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:01,955 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:48:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113114287] [2025-03-04 01:48:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113114287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:48:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225170127] [2025-03-04 01:48:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:01,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:48:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:01,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:48:01,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:48:01,957 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:48:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:03,009 INFO L93 Difference]: Finished difference Result 326 states and 452 transitions. [2025-03-04 01:48:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:48:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-03-04 01:48:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:03,012 INFO L225 Difference]: With dead ends: 326 [2025-03-04 01:48:03,012 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 01:48:03,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:48:03,013 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 239 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:03,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 583 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:48:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 01:48:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 144. [2025-03-04 01:48:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 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:48:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2025-03-04 01:48:03,025 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 134 [2025-03-04 01:48:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:03,025 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2025-03-04 01:48:03,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:48:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2025-03-04 01:48:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:48:03,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:03,026 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:48:03,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:48:03,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:03,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1882623348, now seen corresponding path program 1 times [2025-03-04 01:48:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:03,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720243231] [2025-03-04 01:48:03,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:03,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:48:03,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:48:03,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:05,810 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:48:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720243231] [2025-03-04 01:48:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720243231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:48:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030205676] [2025-03-04 01:48:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:05,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:48:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:05,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:48:05,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:48:05,813 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:48:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:06,911 INFO L93 Difference]: Finished difference Result 335 states and 467 transitions. [2025-03-04 01:48:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:48:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 134 [2025-03-04 01:48:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:06,913 INFO L225 Difference]: With dead ends: 335 [2025-03-04 01:48:06,913 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 01:48:06,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:48:06,914 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 312 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:06,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 509 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:48:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 01:48:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2025-03-04 01:48:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 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:48:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2025-03-04 01:48:06,930 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 134 [2025-03-04 01:48:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:06,931 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2025-03-04 01:48:06,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:48:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2025-03-04 01:48:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:48:06,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:06,932 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:48:06,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:48:06,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1532037136, now seen corresponding path program 1 times [2025-03-04 01:48:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:06,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001682742] [2025-03-04 01:48:06,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:06,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:48:07,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:48:07,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:07,574 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:48:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001682742] [2025-03-04 01:48:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001682742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:48:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59580204] [2025-03-04 01:48:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:07,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:48:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:07,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:48:07,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:48:07,576 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 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:48:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:08,277 INFO L93 Difference]: Finished difference Result 337 states and 460 transitions. [2025-03-04 01:48:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:48:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 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:48:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:08,278 INFO L225 Difference]: With dead ends: 337 [2025-03-04 01:48:08,278 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 01:48:08,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:48:08,279 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 176 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:08,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 792 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:48:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 01:48:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 158. [2025-03-04 01:48:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 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:48:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 216 transitions. [2025-03-04 01:48:08,291 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 216 transitions. Word has length 135 [2025-03-04 01:48:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:08,292 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 216 transitions. [2025-03-04 01:48:08,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 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:48:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 216 transitions. [2025-03-04 01:48:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:48:08,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:08,293 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:48:08,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:48:08,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:08,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2105481406, now seen corresponding path program 1 times [2025-03-04 01:48:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073307691] [2025-03-04 01:48:08,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:08,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:48:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:48:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:10,721 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:48:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:10,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073307691] [2025-03-04 01:48:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073307691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:48:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169510055] [2025-03-04 01:48:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:10,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:48:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:10,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:48:10,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:48:10,723 INFO L87 Difference]: Start difference. First operand 158 states and 216 transitions. Second operand has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:48:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:11,435 INFO L93 Difference]: Finished difference Result 352 states and 482 transitions. [2025-03-04 01:48:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:48:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 135 [2025-03-04 01:48:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:11,437 INFO L225 Difference]: With dead ends: 352 [2025-03-04 01:48:11,437 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 01:48:11,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:11,438 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 321 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:11,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 391 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:48:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 01:48:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 151. [2025-03-04 01:48:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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:48:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 203 transitions. [2025-03-04 01:48:11,450 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 203 transitions. Word has length 135 [2025-03-04 01:48:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:11,450 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 203 transitions. [2025-03-04 01:48:11,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 01:48:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 203 transitions. [2025-03-04 01:48:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:48:11,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:11,452 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:48:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:48:11,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2089949092, now seen corresponding path program 1 times [2025-03-04 01:48:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198217350] [2025-03-04 01:48:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:48:11,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:48:11,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:11,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:13,170 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:48:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198217350] [2025-03-04 01:48:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198217350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:48:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585784587] [2025-03-04 01:48:13,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:13,173 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:48:13,174 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:48:13,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:48:13,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:48:13,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:13,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:13,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 01:48:13,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:14,657 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 15 treesize of output 1 [2025-03-04 01:48:15,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:48:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:48:15,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:48:15,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,645 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 01:48:15,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 23 treesize of output 25 [2025-03-04 01:48:15,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,703 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2025-03-04 01:48:15,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 35 [2025-03-04 01:48:15,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,830 INFO L349 Elim1Store]: treesize reduction 65, result has 18.8 percent of original size [2025-03-04 01:48:15,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 46 [2025-03-04 01:48:15,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:48:15,917 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:48:15,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-04 01:48:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 153 proven. 177 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-04 01:48:15,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:48:28,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585784587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:48:28,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:48:28,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2025-03-04 01:48:28,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523495256] [2025-03-04 01:48:28,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:48:28,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:48:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:28,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:48:28,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=476, Unknown=2, NotChecked=0, Total=600 [2025-03-04 01:48:28,342 INFO L87 Difference]: Start difference. First operand 151 states and 203 transitions. Second operand has 21 states, 19 states have (on average 5.526315789473684) internal successors, (105), 21 states have internal predecessors, (105), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 01:48:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:29,175 INFO L93 Difference]: Finished difference Result 362 states and 485 transitions. [2025-03-04 01:48:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:48:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.526315789473684) internal successors, (105), 21 states have internal predecessors, (105), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 135 [2025-03-04 01:48:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:29,178 INFO L225 Difference]: With dead ends: 362 [2025-03-04 01:48:29,178 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:48:29,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=259, Invalid=731, Unknown=2, NotChecked=0, Total=992 [2025-03-04 01:48:29,178 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 345 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:29,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 460 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:48:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:48:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 155. [2025-03-04 01:48:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.2592592592592593) internal successors, (170), 135 states have internal predecessors, (170), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:48:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 204 transitions. [2025-03-04 01:48:29,195 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 204 transitions. Word has length 135 [2025-03-04 01:48:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:29,196 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 204 transitions. [2025-03-04 01:48:29,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.526315789473684) internal successors, (105), 21 states have internal predecessors, (105), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 01:48:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 204 transitions. [2025-03-04 01:48:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:48:29,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:29,197 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:48:29,204 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:48:29,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:29,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:29,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1796546085, now seen corresponding path program 1 times [2025-03-04 01:48:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766340028] [2025-03-04 01:48:29,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:29,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:48:29,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:48:29,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:29,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:48:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035500713] [2025-03-04 01:48:29,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:29,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:29,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:29,483 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:48:29,484 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:48:29,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:48:29,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:48:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:29,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-04 01:48:29,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:29,818 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 43 treesize of output 42 [2025-03-04 01:48:30,396 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 84 treesize of output 69 [2025-03-04 01:48:31,938 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 97 treesize of output 78 [2025-03-04 01:48:33,666 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 110 treesize of output 87 [2025-03-04 01:48:35,683 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 125 treesize of output 98 [2025-03-04 01:48:37,335 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 131 treesize of output 102 [2025-03-04 01:48:38,867 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 131 treesize of output 102 [2025-03-04 01:48:41,716 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 149 treesize of output 114 [2025-03-04 01:48:43,282 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 153 treesize of output 116 [2025-03-04 01:48:46,782 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 186 treesize of output 141 [2025-03-04 01:48:47,183 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 261 treesize of output 194 [2025-03-04 01:48:47,858 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 380 treesize of output 283 [2025-03-04 01:49:01,793 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 12620 treesize of output 9645