./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-30.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 dc2fe70e94d243c3ae1cdd98b82e6067b1168df8c474310114d000e70da816e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:07:14,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:07:14,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:07:14,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:07:14,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:07:14,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:07:14,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:07:14,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:07:14,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:07:14,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:07:14,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:07:14,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:07:14,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:07:14,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:07:14,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:07:14,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:07:14,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:14,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:07:14,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:07:14,916 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 -> dc2fe70e94d243c3ae1cdd98b82e6067b1168df8c474310114d000e70da816e2 [2025-03-17 06:07:15,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:07:15,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:07:15,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:07:15,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:07:15,178 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:07:15,179 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-30.i [2025-03-17 06:07:16,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5b578d6/39306ba26d52491a8395c96e8bd05e72/FLAG7e91ed29c [2025-03-17 06:07:16,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:07:16,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-30.i [2025-03-17 06:07:16,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5b578d6/39306ba26d52491a8395c96e8bd05e72/FLAG7e91ed29c [2025-03-17 06:07:16,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5b578d6/39306ba26d52491a8395c96e8bd05e72 [2025-03-17 06:07:16,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:07:16,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:07:16,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:16,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:07:16,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:07:16,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:16" (1/1) ... [2025-03-17 06:07:16,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e48f2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:16, skipping insertion in model container [2025-03-17 06:07:16,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:16" (1/1) ... [2025-03-17 06:07:16,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:07:17,049 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-30.i[917,930] [2025-03-17 06:07:17,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:17,113 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:07:17,119 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-30.i[917,930] [2025-03-17 06:07:17,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:17,170 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:07:17,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17 WrapperNode [2025-03-17 06:07:17,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:17,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:17,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:07:17,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:07:17,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,213 INFO L138 Inliner]: procedures = 30, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2025-03-17 06:07:17,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:17,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:07:17,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:07:17,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:07:17,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,234 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:07:17,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:07:17,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:07:17,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:07:17,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:07:17,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (1/1) ... [2025-03-17 06:07:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:17,308 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-17 06:07:17,311 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-17 06:07:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:07:17,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:07:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:07:17,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:07:17,427 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:07:17,429 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:07:17,926 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~mem90#1;havoc property_#t~ite110#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~ite105#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite125#1;havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem115#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~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite144#1;havoc property_#t~mem133#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~bitwise132#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem143#1;havoc property_#t~mem138#1;havoc property_#t~ite141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem142#1;havoc property_#t~short145#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1; [2025-03-17 06:07:17,963 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-17 06:07:17,963 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:07:17,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:07:17,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:07:17,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:17 BoogieIcfgContainer [2025-03-17 06:07:17,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:07:17,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:07:17,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:07:17,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:07:17,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:07:16" (1/3) ... [2025-03-17 06:07:17,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276912fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:17, skipping insertion in model container [2025-03-17 06:07:17,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:17" (2/3) ... [2025-03-17 06:07:17,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276912fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:17, skipping insertion in model container [2025-03-17 06:07:17,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:17" (3/3) ... [2025-03-17 06:07:17,984 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-30.i [2025-03-17 06:07:17,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:07:17,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-30.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:07:18,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:07:18,050 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;@3619a1f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:07:18,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:07:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 94 states have internal predecessors, (133), 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-17 06:07:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:07:18,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:18,062 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-17 06:07:18,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1018569704, now seen corresponding path program 1 times [2025-03-17 06:07:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705605007] [2025-03-17 06:07:18,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:18,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:07:18,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:07:18,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:18,409 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-17 06:07:18,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:18,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705605007] [2025-03-17 06:07:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705605007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:18,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469605228] [2025-03-17 06:07:18,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:18,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:07:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:18,417 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-17 06:07:18,419 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-17 06:07:18,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:07:18,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:07:18,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:18,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:18,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:07:18,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:18,648 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-17 06:07:18,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:18,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469605228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:18,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:07:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:07:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232026776] [2025-03-17 06:07:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:07:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:18,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:07:18,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:18,672 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 94 states have internal predecessors, (133), 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.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 06:07:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:18,698 INFO L93 Difference]: Finished difference Result 223 states and 349 transitions. [2025-03-17 06:07:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:07:18,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 133 [2025-03-17 06:07:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:18,705 INFO L225 Difference]: With dead ends: 223 [2025-03-17 06:07:18,705 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:07:18,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-17 06:07:18,709 INFO L435 NwaCegarLoop]: 161 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, 161 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-17 06:07:18,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:07:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 06:07:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 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-17 06:07:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2025-03-17 06:07:18,738 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 133 [2025-03-17 06:07:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:18,738 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2025-03-17 06:07:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-17 06:07:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2025-03-17 06:07:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:07:18,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:18,743 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-17 06:07:18,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:07:18,943 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-17 06:07:18,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 908614757, now seen corresponding path program 1 times [2025-03-17 06:07:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522085162] [2025-03-17 06:07:18,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:18,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:07:19,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:07:19,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:19,307 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-17 06:07:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522085162] [2025-03-17 06:07:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522085162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:07:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592281236] [2025-03-17 06:07:19,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:19,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:07:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:19,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:07:19,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:19,309 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 06:07:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:19,354 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2025-03-17 06:07:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:07:19,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 133 [2025-03-17 06:07:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:19,357 INFO L225 Difference]: With dead ends: 224 [2025-03-17 06:07:19,357 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 06:07:19,358 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-17 06:07:19,360 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 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-17 06:07:19,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 06:07:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 06:07:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 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-17 06:07:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-03-17 06:07:19,379 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 133 [2025-03-17 06:07:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:19,380 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-03-17 06:07:19,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 06:07:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-03-17 06:07:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:07:19,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:19,382 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-17 06:07:19,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:07:19,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 909538278, now seen corresponding path program 1 times [2025-03-17 06:07:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853742869] [2025-03-17 06:07:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:07:19,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:07:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:21,400 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-17 06:07:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:21,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853742869] [2025-03-17 06:07:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853742869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:07:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337765679] [2025-03-17 06:07:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:21,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:07:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:21,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:07:21,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:21,404 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:22,379 INFO L93 Difference]: Finished difference Result 252 states and 369 transitions. [2025-03-17 06:07:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:07:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 133 [2025-03-17 06:07:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:22,381 INFO L225 Difference]: With dead ends: 252 [2025-03-17 06:07:22,381 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 06:07:22,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:07:22,383 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 299 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:22,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 464 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 06:07:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2025-03-17 06:07:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 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-17 06:07:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2025-03-17 06:07:22,401 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 133 [2025-03-17 06:07:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:22,403 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2025-03-17 06:07:22,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2025-03-17 06:07:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:07:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:22,408 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-17 06:07:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:07:22,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2070458103, now seen corresponding path program 1 times [2025-03-17 06:07:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917250699] [2025-03-17 06:07:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:07:22,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:07:22,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:24,057 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-17 06:07:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917250699] [2025-03-17 06:07:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917250699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:24,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:07:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324296612] [2025-03-17 06:07:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:07:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:24,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:07:24,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:07:24,060 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:24,789 INFO L93 Difference]: Finished difference Result 295 states and 426 transitions. [2025-03-17 06:07:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-17 06:07:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:24,791 INFO L225 Difference]: With dead ends: 295 [2025-03-17 06:07:24,792 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 06:07:24,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:07:24,793 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 276 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:24,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 523 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:07:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 06:07:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2025-03-17 06:07:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 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-17 06:07:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2025-03-17 06:07:24,805 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 134 [2025-03-17 06:07:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2025-03-17 06:07:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2025-03-17 06:07:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:07:24,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:24,807 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:24,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:07:24,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1872029347, now seen corresponding path program 1 times [2025-03-17 06:07:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376604759] [2025-03-17 06:07:24,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:24,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:07:24,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:07:24,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:24,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:25,957 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-17 06:07:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376604759] [2025-03-17 06:07:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376604759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:25,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:25,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:07:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405290358] [2025-03-17 06:07:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:25,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:07:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:07:25,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:07:25,960 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:26,898 INFO L93 Difference]: Finished difference Result 343 states and 492 transitions. [2025-03-17 06:07:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:07:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-17 06:07:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:26,900 INFO L225 Difference]: With dead ends: 343 [2025-03-17 06:07:26,900 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 06:07:26,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:07:26,901 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 300 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:26,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 585 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 06:07:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2025-03-17 06:07:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 139 states have internal predecessors, (189), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:07:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 233 transitions. [2025-03-17 06:07:26,931 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 233 transitions. Word has length 134 [2025-03-17 06:07:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:26,932 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 233 transitions. [2025-03-17 06:07:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 233 transitions. [2025-03-17 06:07:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:07:26,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:26,933 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-17 06:07:26,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:07:26,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1578626340, now seen corresponding path program 1 times [2025-03-17 06:07:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151078694] [2025-03-17 06:07:26,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:26,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:07:27,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:07:27,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:27,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:07:28,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151078694] [2025-03-17 06:07:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151078694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:07:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195639017] [2025-03-17 06:07:28,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:28,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:07:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:28,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:07:28,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:07:28,781 INFO L87 Difference]: Start difference. First operand 163 states and 233 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:30,213 INFO L93 Difference]: Finished difference Result 419 states and 599 transitions. [2025-03-17 06:07:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:07:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-17 06:07:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:30,218 INFO L225 Difference]: With dead ends: 419 [2025-03-17 06:07:30,218 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 06:07:30,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-03-17 06:07:30,221 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 626 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:30,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 766 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:07:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 06:07:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2025-03-17 06:07:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 156 states have internal predecessors, (214), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:07:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2025-03-17 06:07:30,246 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 134 [2025-03-17 06:07:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:30,246 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2025-03-17 06:07:30,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2025-03-17 06:07:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:07:30,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:30,248 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-17 06:07:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:07:30,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:30,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1009231493, now seen corresponding path program 1 times [2025-03-17 06:07:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679766048] [2025-03-17 06:07:30,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:07:30,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:07:30,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:30,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:32,256 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-17 06:07:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679766048] [2025-03-17 06:07:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679766048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:32,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:32,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 06:07:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601173802] [2025-03-17 06:07:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:07:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:32,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:07:32,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:07:32,259 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:33,729 INFO L93 Difference]: Finished difference Result 395 states and 566 transitions. [2025-03-17 06:07:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:07:33,733 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-17 06:07:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:33,734 INFO L225 Difference]: With dead ends: 395 [2025-03-17 06:07:33,734 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 06:07:33,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:07:33,735 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 375 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:33,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1069 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:07:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 06:07:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2025-03-17 06:07:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 162 states have (on average 1.376543209876543) internal successors, (223), 163 states have internal predecessors, (223), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:07:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 267 transitions. [2025-03-17 06:07:33,753 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 267 transitions. Word has length 134 [2025-03-17 06:07:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:33,753 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 267 transitions. [2025-03-17 06:07:33,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 267 transitions. [2025-03-17 06:07:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 06:07:33,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:33,754 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, 1] [2025-03-17 06:07:33,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:07:33,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:33,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 337068331, now seen corresponding path program 1 times [2025-03-17 06:07:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896326960] [2025-03-17 06:07:33,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:33,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:07:33,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:07:33,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:33,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 06:07:33,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896326960] [2025-03-17 06:07:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896326960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41303025] [2025-03-17 06:07:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:07:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:33,877 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-17 06:07:33,878 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-17 06:07:33,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:07:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:07:34,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:34,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:07:34,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:34,099 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-17 06:07:34,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41303025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:07:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 06:07:34,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134431307] [2025-03-17 06:07:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:34,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:07:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:34,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:07:34,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:34,100 INFO L87 Difference]: Start difference. First operand 187 states and 267 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-17 06:07:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:34,142 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2025-03-17 06:07:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:07:34,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 136 [2025-03-17 06:07:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:34,144 INFO L225 Difference]: With dead ends: 362 [2025-03-17 06:07:34,144 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 06:07:34,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:34,145 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:34,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 622 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 06:07:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-03-17 06:07:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 164 states have internal predecessors, (224), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:07:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 268 transitions. [2025-03-17 06:07:34,163 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 268 transitions. Word has length 136 [2025-03-17 06:07:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:34,163 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 268 transitions. [2025-03-17 06:07:34,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-17 06:07:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 268 transitions. [2025-03-17 06:07:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 06:07:34,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:34,165 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, 1] [2025-03-17 06:07:34,173 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-17 06:07:34,366 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,SelfDestructingSolverStorable7 [2025-03-17 06:07:34,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash 870853755, now seen corresponding path program 1 times [2025-03-17 06:07:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030959752] [2025-03-17 06:07:34,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:34,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:07:34,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:07:34,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:34,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:35,458 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-17 06:07:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030959752] [2025-03-17 06:07:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030959752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:07:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810239200] [2025-03-17 06:07:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:07:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:35,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:07:35,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:07:35,460 INFO L87 Difference]: Start difference. First operand 188 states and 268 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:36,215 INFO L93 Difference]: Finished difference Result 430 states and 612 transitions. [2025-03-17 06:07:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:36,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-03-17 06:07:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:36,217 INFO L225 Difference]: With dead ends: 430 [2025-03-17 06:07:36,217 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 06:07:36,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:07:36,218 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 194 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:36,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 621 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 06:07:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 220. [2025-03-17 06:07:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.3794871794871795) internal successors, (269), 196 states have internal predecessors, (269), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:07:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 313 transitions. [2025-03-17 06:07:36,241 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 313 transitions. Word has length 136 [2025-03-17 06:07:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:36,241 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 313 transitions. [2025-03-17 06:07:36,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 313 transitions. [2025-03-17 06:07:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 06:07:36,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:36,242 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, 1] [2025-03-17 06:07:36,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:07:36,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:36,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash -856747620, now seen corresponding path program 1 times [2025-03-17 06:07:36,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:36,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213427153] [2025-03-17 06:07:36,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:36,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:07:36,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:07:36,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:36,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:38,269 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-17 06:07:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213427153] [2025-03-17 06:07:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213427153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 06:07:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057217711] [2025-03-17 06:07:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:07:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:38,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:07:38,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:07:38,270 INFO L87 Difference]: Start difference. First operand 220 states and 313 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:39,886 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2025-03-17 06:07:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:07:39,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-03-17 06:07:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:39,893 INFO L225 Difference]: With dead ends: 532 [2025-03-17 06:07:39,893 INFO L226 Difference]: Without dead ends: 327 [2025-03-17 06:07:39,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2025-03-17 06:07:39,894 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 563 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:39,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 844 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:07:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-17 06:07:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 254. [2025-03-17 06:07:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 229 states have (on average 1.3755458515283843) internal successors, (315), 230 states have internal predecessors, (315), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:07:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 359 transitions. [2025-03-17 06:07:39,912 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 359 transitions. Word has length 136 [2025-03-17 06:07:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 359 transitions. [2025-03-17 06:07:39,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 359 transitions. [2025-03-17 06:07:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 06:07:39,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:39,916 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, 1, 1] [2025-03-17 06:07:39,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:07:39,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:39,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 550718879, now seen corresponding path program 1 times [2025-03-17 06:07:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670188530] [2025-03-17 06:07:39,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 06:07:39,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 06:07:39,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:39,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:41,338 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-17 06:07:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:41,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670188530] [2025-03-17 06:07:41,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670188530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:41,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:41,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:07:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984578252] [2025-03-17 06:07:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:07:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:41,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:07:41,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:07:41,339 INFO L87 Difference]: Start difference. First operand 254 states and 359 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:42,379 INFO L93 Difference]: Finished difference Result 698 states and 993 transitions. [2025-03-17 06:07:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:07:42,380 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 137 [2025-03-17 06:07:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:42,382 INFO L225 Difference]: With dead ends: 698 [2025-03-17 06:07:42,382 INFO L226 Difference]: Without dead ends: 459 [2025-03-17 06:07:42,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:07:42,383 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 134 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:42,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 621 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-17 06:07:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 318. [2025-03-17 06:07:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 280 states have (on average 1.3892857142857142) internal successors, (389), 280 states have internal predecessors, (389), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:07:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 457 transitions. [2025-03-17 06:07:42,412 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 457 transitions. Word has length 137 [2025-03-17 06:07:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:42,412 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 457 transitions. [2025-03-17 06:07:42,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 457 transitions. [2025-03-17 06:07:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 06:07:42,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:42,414 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, 1, 1] [2025-03-17 06:07:42,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:07:42,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:42,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash -486979137, now seen corresponding path program 1 times [2025-03-17 06:07:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949077338] [2025-03-17 06:07:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:42,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 06:07:42,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 06:07:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:47,317 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-17 06:07:47,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:47,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949077338] [2025-03-17 06:07:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949077338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 06:07:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221025771] [2025-03-17 06:07:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:47,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:07:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:47,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:07:47,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:07:47,319 INFO L87 Difference]: Start difference. First operand 318 states and 457 transitions. Second operand has 19 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-17 06:07:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:49,710 INFO L93 Difference]: Finished difference Result 619 states and 882 transitions. [2025-03-17 06:07:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:07:49,711 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) Word has length 137 [2025-03-17 06:07:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:49,713 INFO L225 Difference]: With dead ends: 619 [2025-03-17 06:07:49,713 INFO L226 Difference]: Without dead ends: 380 [2025-03-17 06:07:49,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-17 06:07:49,714 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 528 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:49,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 879 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 06:07:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-17 06:07:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 298. [2025-03-17 06:07:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3884615384615384) internal successors, (361), 260 states have internal predecessors, (361), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:07:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 429 transitions. [2025-03-17 06:07:49,749 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 429 transitions. Word has length 137 [2025-03-17 06:07:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 429 transitions. [2025-03-17 06:07:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-17 06:07:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 429 transitions. [2025-03-17 06:07:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 06:07:49,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:49,751 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, 1, 1, 1] [2025-03-17 06:07:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:07:49,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1146544798, now seen corresponding path program 1 times [2025-03-17 06:07:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780320000] [2025-03-17 06:07:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:49,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 06:07:49,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 06:07:49,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:49,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:51,080 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-17 06:07:51,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:51,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780320000] [2025-03-17 06:07:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780320000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:51,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:07:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194943699] [2025-03-17 06:07:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:51,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:07:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:07:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:07:51,081 INFO L87 Difference]: Start difference. First operand 298 states and 429 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:51,714 INFO L93 Difference]: Finished difference Result 574 states and 817 transitions. [2025-03-17 06:07:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-03-17 06:07:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:51,717 INFO L225 Difference]: With dead ends: 574 [2025-03-17 06:07:51,717 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 06:07:51,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:07:51,720 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 271 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:51,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 455 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:07:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 06:07:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 260. [2025-03-17 06:07:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 222 states have (on average 1.3693693693693694) internal successors, (304), 222 states have internal predecessors, (304), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:07:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 372 transitions. [2025-03-17 06:07:51,758 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 372 transitions. Word has length 138 [2025-03-17 06:07:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:51,759 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 372 transitions. [2025-03-17 06:07:51,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 372 transitions. [2025-03-17 06:07:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 06:07:51,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:51,761 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, 1, 1, 1] [2025-03-17 06:07:51,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:07:51,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:51,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 858986529, now seen corresponding path program 1 times [2025-03-17 06:07:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:51,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416998250] [2025-03-17 06:07:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 06:07:51,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 06:07:51,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:51,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:53,039 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-17 06:07:53,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:53,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416998250] [2025-03-17 06:07:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416998250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:53,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:07:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161271365] [2025-03-17 06:07:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:53,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:07:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:53,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:07:53,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:07:53,040 INFO L87 Difference]: Start difference. First operand 260 states and 372 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:53,924 INFO L93 Difference]: Finished difference Result 515 states and 729 transitions. [2025-03-17 06:07:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:07:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-03-17 06:07:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:53,932 INFO L225 Difference]: With dead ends: 515 [2025-03-17 06:07:53,932 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 06:07:53,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:07:53,933 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 362 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:53,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 905 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 06:07:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 298. [2025-03-17 06:07:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.373076923076923) internal successors, (357), 260 states have internal predecessors, (357), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:07:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 425 transitions. [2025-03-17 06:07:53,972 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 425 transitions. Word has length 138 [2025-03-17 06:07:53,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:53,972 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 425 transitions. [2025-03-17 06:07:53,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:07:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 425 transitions. [2025-03-17 06:07:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 06:07:53,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:53,974 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, 1, 1, 1] [2025-03-17 06:07:53,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:07:53,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:53,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1508558590, now seen corresponding path program 1 times [2025-03-17 06:07:53,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:53,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682407803] [2025-03-17 06:07:53,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:53,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 06:07:54,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 06:07:54,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:54,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:56,310 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-17 06:07:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:56,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682407803] [2025-03-17 06:07:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682407803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:07:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202453030] [2025-03-17 06:07:56,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:56,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:07:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:56,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:07:56,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:07:56,312 INFO L87 Difference]: Start difference. First operand 298 states and 425 transitions. Second operand has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 06:07:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:57,224 INFO L93 Difference]: Finished difference Result 535 states and 756 transitions. [2025-03-17 06:07:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:07:57,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 4 states have call successors, (17) Word has length 138 [2025-03-17 06:07:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:57,227 INFO L225 Difference]: With dead ends: 535 [2025-03-17 06:07:57,227 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 06:07:57,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:07:57,228 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 213 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:57,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 575 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:07:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 06:07:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 298. [2025-03-17 06:07:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3692307692307693) internal successors, (356), 260 states have internal predecessors, (356), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:07:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 424 transitions. [2025-03-17 06:07:57,279 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 424 transitions. Word has length 138 [2025-03-17 06:07:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:57,279 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 424 transitions. [2025-03-17 06:07:57,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 06:07:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 424 transitions. [2025-03-17 06:07:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 06:07:57,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:57,280 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, 1, 1, 1, 1] [2025-03-17 06:07:57,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:07:57,281 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:57,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash -494641594, now seen corresponding path program 1 times [2025-03-17 06:07:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494197843] [2025-03-17 06:07:57,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:57,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 06:07:57,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 06:07:57,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:57,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:58,306 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-17 06:07:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494197843] [2025-03-17 06:07:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494197843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:07:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628293279] [2025-03-17 06:07:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:07:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:58,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:07:58,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:07:58,308 INFO L87 Difference]: Start difference. First operand 298 states and 424 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 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-17 06:07:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:58,799 INFO L93 Difference]: Finished difference Result 499 states and 707 transitions. [2025-03-17 06:07:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 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 139 [2025-03-17 06:07:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:58,802 INFO L225 Difference]: With dead ends: 499 [2025-03-17 06:07:58,802 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 06:07:58,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:07:58,803 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 166 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:58,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 367 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:07:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 06:07:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2025-03-17 06:07:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 239 states have internal predecessors, (324), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:07:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 392 transitions. [2025-03-17 06:07:58,856 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 392 transitions. Word has length 139 [2025-03-17 06:07:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:58,856 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 392 transitions. [2025-03-17 06:07:58,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 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-17 06:07:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 392 transitions. [2025-03-17 06:07:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 06:07:58,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:58,857 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, 1, 1, 1, 1] [2025-03-17 06:07:58,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:07:58,858 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:58,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1651635301, now seen corresponding path program 1 times [2025-03-17 06:07:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539407125] [2025-03-17 06:07:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:58,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 06:07:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 06:07:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:08:00,198 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-17 06:08:00,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:08:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539407125] [2025-03-17 06:08:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539407125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:08:00,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:08:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:08:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799825349] [2025-03-17 06:08:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:08:00,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:08:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:08:00,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:08:00,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:08:00,201 INFO L87 Difference]: Start difference. First operand 277 states and 392 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:08:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:08:01,146 INFO L93 Difference]: Finished difference Result 529 states and 740 transitions. [2025-03-17 06:08:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:08:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2025-03-17 06:08:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:08:01,149 INFO L225 Difference]: With dead ends: 529 [2025-03-17 06:08:01,149 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 06:08:01,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:08:01,151 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 304 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:08:01,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 754 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:08:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 06:08:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 277. [2025-03-17 06:08:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 239 states have internal predecessors, (324), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:08:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 392 transitions. [2025-03-17 06:08:01,185 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 392 transitions. Word has length 139 [2025-03-17 06:08:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:08:01,186 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 392 transitions. [2025-03-17 06:08:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:08:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 392 transitions. [2025-03-17 06:08:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 06:08:01,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:08:01,187 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, 1, 1, 1, 1, 1] [2025-03-17 06:08:01,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:08:01,187 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:08:01,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:08:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash -777068974, now seen corresponding path program 1 times [2025-03-17 06:08:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:08:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809398407] [2025-03-17 06:08:01,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:08:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:08:01,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:08:01,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:08:01,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:08:01,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:08:02,467 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-17 06:08:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:08:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809398407] [2025-03-17 06:08:02,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809398407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:08:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891498443] [2025-03-17 06:08:02,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:08:02,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:08:02,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:08:02,470 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-17 06:08:02,471 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-17 06:08:02,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 06:08:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 06:08:02,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:08:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:08:02,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-17 06:08:02,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:08:02,744 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 46 treesize of output 45 [2025-03-17 06:08:02,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2025-03-17 06:08:03,181 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-17 06:08:03,588 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-17 06:08:03,988 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-17 06:08:04,238 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-17 06:08:04,492 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-17 06:08:04,759 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-17 06:08:04,962 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-17 06:08:05,153 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-17 06:08:06,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,235 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2025-03-17 06:08:06,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 74 [2025-03-17 06:08:06,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,671 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-17 06:08:06,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 67 [2025-03-17 06:08:06,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:06,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 50 [2025-03-17 06:08:06,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 42 [2025-03-17 06:08:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:08:07,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:08:31,450 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~last_1_WrapperStruct00_var_1_10~0 0)) (.cse9 (< c_~last_1_WrapperStruct00_var_1_10~0 0)) (.cse231 (< 0 (+ c_~last_1_WrapperStruct00_var_1_10~0 1))) (.cse24 (< c_~last_1_WrapperStruct00_var_1_10~0 1)) (.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base))) (and (or (and (or (forall ((v_ArrVal_1920 Int)) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse0 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse1 (select (select .cse2 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< 0 (+ .cse0 1)) (< 0 (+ .cse1 1)) (< (+ .cse1 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse0 .cse1) 1)))))) .cse4) (forall ((v_ArrVal_1920 Int)) (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse7 (select (select .cse8 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse5 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse7)) (.cse6 (select (select .cse8 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< 0 (+ .cse5 1)) (< 0 (+ .cse6 1)) (= 0 (mod (div 0 .cse7) .cse6)) (< (+ .cse6 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse5 .cse6) 1)))))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse13 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse12 (select (select .cse13 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse11 (select (select .cse13 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse10 (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse12) .cse11))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse10 .cse11 1)) (< .cse12 0) (< (+ .cse11 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse10 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse12) 0))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse17 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse14 (select (select .cse17 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse15 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse14))) (or (< 0 (+ 1 .cse14)) (< 0 (+ .cse15 1)) (let ((.cse16 (select (select .cse17 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (< (+ .cse16 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse15 .cse16) 1)))))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse21 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse20 (select (select .cse21 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse18 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse20)) (.cse19 (select (select .cse21 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse18) .cse19) 1)) (< 0 (+ 1 .cse20)) (< 0 (+ .cse18 1)) (< (+ .cse19 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse18 .cse19) 1))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse23 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse22 (select (select .cse23 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< 0 (+ (div c_~last_1_WrapperStruct00_var_1_10~0 .cse22) 1)) (< 0 (+ (select (select .cse23 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse22) 0)))))) .cse24) (forall ((v_ArrVal_1920 Int)) (let ((.cse28 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse25 (select (select .cse28 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse26 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse25))) (or (< 0 (+ 1 .cse25)) (< 0 (+ .cse26 1)) (let ((.cse27 (select (select .cse28 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (< (+ .cse27 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse26 .cse27) 1))) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse25) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse34 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse31 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse34 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse29 (+ .cse31 1)) (.cse30 (select (select .cse34 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse32 (mod .cse31 .cse30)) (.cse33 (mod .cse29 .cse30))) (or (= .cse29 0) (< .cse30 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse31) .cse30) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse32 .cse30 1)) (= .cse32 0) (< (+ .cse30 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse33 1)) (= .cse33 0) (< 0 .cse29))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse38 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse36 (select (select .cse38 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse37 (select (select .cse38 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse35 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse36) .cse37) 1))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 .cse35) (< 0 (+ 1 .cse36)) (< (+ .cse37 c_~last_1_WrapperStruct00_var_1_10~0) .cse35)))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse44 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse42 (select (select .cse44 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse39 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse42))) (let ((.cse43 (+ .cse39 1)) (.cse40 (select (select .cse44 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse41 (mod .cse43 .cse40))) (or (= (mod .cse39 .cse40) 0) (< (+ .cse40 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse41 1)) (< .cse42 0) (= .cse41 0) (< 0 .cse43) (< 0 (+ .cse40 1))))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse48 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse47 (select (select .cse48 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse45 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse47)) (.cse46 (select (select .cse48 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse45) .cse46) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse45 .cse46) 1)) (< 0 (+ 1 .cse47)) (< 0 (+ .cse46 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse51 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse49 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse51 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse50 (select (select .cse51 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse49) .cse50) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse49 .cse50) 1)) (= (mod (+ .cse49 1) .cse50) 0) (< 0 (+ 2 .cse49)) (< 0 (+ .cse50 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse58 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse56 (select (select .cse58 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse57 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse56))) (let ((.cse52 (+ .cse57 1)) (.cse53 (select (select .cse58 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse54 (mod .cse57 .cse53)) (.cse55 (mod .cse52 .cse53))) (or (= .cse52 0) (< .cse53 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse54 .cse53 1)) (= .cse54 0) (< (+ .cse53 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse55 1)) (< .cse56 0) (= .cse55 0) (< 0 .cse52)))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse60 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse59 (select (select .cse60 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse59 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse60 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) .cse59) 1)))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse65 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse64 (select (select .cse65 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse62 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse64)) (.cse63 (select (select .cse65 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse61 (mod .cse62 .cse63))) (or (= .cse61 0) (< 0 (+ .cse62 1)) (< 0 (+ .cse63 1)) (< (+ .cse63 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse61 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse64) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse70 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse69 (select (select .cse70 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse68 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse69)) (.cse67 (select (select .cse70 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse66 (mod .cse68 .cse67))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse66 .cse67 1)) (= .cse66 0) (< 0 (+ .cse68 1)) (< (+ .cse67 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse66 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse69) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse75 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse74 (select (select .cse75 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse72 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse74)) (.cse71 (select (select .cse75 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse73 (mod (+ .cse72 1) .cse71))) (or (< .cse71 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse72 .cse71) .cse71 1)) (< (+ .cse71 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse73 1)) (= .cse73 0) (< 0 (+ 2 .cse72)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse74) 0)))))))) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse78 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse77 (select (select .cse78 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse76 (select (select .cse78 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse76 0) (< .cse77 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse77) .cse76) 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse83 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse81 (select (select .cse83 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse82 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse81)) (.cse79 (select (select .cse83 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse80 (mod .cse82 .cse79))) (or (< .cse79 0) (= .cse80 0) (< .cse81 0) (< 0 (+ .cse82 1)) (< (+ .cse79 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse80 1)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse86 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse84 (select (select .cse86 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse85 (select (select .cse86 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse84 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse84) .cse85) 1)) (< 0 (+ .cse85 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse90 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse89 (select (select .cse90 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse88 (select (select .cse90 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse87 (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse89) .cse88))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse87 .cse88 1)) (< .cse89 0) (< (+ .cse88 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse87 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse95 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse93 (select (select .cse95 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse94 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse93)) (.cse92 (select (select .cse95 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse91 (mod .cse94 .cse92))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse91 .cse92 1)) (= .cse91 0) (< .cse93 0) (< 0 (+ .cse94 1)) (< (+ .cse92 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse91 1)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse99 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse98 (select (select .cse99 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse96 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse98)) (.cse97 (select (select .cse99 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod .cse96 .cse97) 0) (< .cse98 0) (< 0 (+ .cse96 1)) (< 0 (+ .cse97 1)))))))) .cse9) (or .cse24 (forall ((v_ArrVal_1920 Int)) (let ((.cse103 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse102 (select (select .cse103 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse101 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse102)) (.cse100 (select (select .cse103 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse100 0) (< 0 (+ .cse101 1)) (< (+ .cse100 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse101 .cse100) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse102) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse106 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse105 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse106 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse104 (select (select .cse106 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse104 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse105) .cse104) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse105 .cse104) .cse104 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse105 1) .cse104) 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse109 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse108 (select (select .cse109 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse107 (select (select .cse109 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse107) .cse108) 1)) (< 0 (+ 1 .cse107)) (< 0 (+ .cse108 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse107) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse113 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse112 (select (select .cse113 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse110 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse112)) (.cse111 (select (select .cse113 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse110 .cse111) 1)) (= (mod (+ .cse110 1) .cse111) 0) (< 0 (+ 2 .cse110)) (< 0 (+ .cse111 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse112) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse116 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse114 (select (select .cse116 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse115 (select (select .cse116 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< .cse114 0) (< .cse115 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse115) .cse114) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse115) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse119 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse117 (select (select .cse119 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse118 (select (select .cse119 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< .cse117 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse118) .cse117) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse118) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse126 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse122 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse126 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse120 (+ .cse122 1)) (.cse121 (select (select .cse126 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse125 (mod .cse120 .cse121)) (.cse124 (+ .cse121 c_~last_1_WrapperStruct00_var_1_10~0)) (.cse123 (mod .cse122 .cse121))) (or (= .cse120 0) (< .cse121 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse122) .cse121) 1)) (= .cse123 0) (< .cse124 (+ .cse125 1)) (= .cse125 0) (< 0 .cse120) (< .cse124 (+ .cse123 1)))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse130 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse129 (select (select .cse130 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse127 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse129)) (.cse128 (select (select .cse130 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< 0 (+ .cse127 1)) (< 0 (+ .cse128 1)) (< (+ .cse128 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse127 .cse128) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse129) 0))))))) .cse24) (forall ((v_ArrVal_1920 Int)) (let ((.cse135 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse133 (select (select .cse135 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse134 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse133)) (.cse132 (select (select .cse135 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse131 (mod .cse134 .cse132))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse131 .cse132 1)) (= .cse131 0) (< .cse133 0) (< 0 (+ .cse134 1)) (< (+ .cse132 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse131 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse133) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse140 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse138 (select (select .cse140 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse139 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse140 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse137 (+ .cse139 1)) (.cse136 (mod .cse139 .cse138))) (or (= .cse136 0) (= (mod .cse137 .cse138) 0) (< 0 .cse137) (< 0 (+ .cse138 1)) (< (+ .cse138 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse136 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse145 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse144 (select (select .cse145 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse143 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse144)) (.cse142 (select (select .cse145 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse141 (mod (+ .cse143 1) .cse142))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse141 .cse142 1)) (< (+ .cse142 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse141 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse143 .cse142) 1)) (= .cse141 0) (< 0 (+ 2 .cse143)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse144) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse149 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse148 (select (select .cse149 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse147 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse148)) (.cse146 (select (select .cse149 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse146 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse147 .cse146) .cse146 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse147 1) .cse146) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse148) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse154 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse153 (select (select .cse154 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse152 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse153)) (.cse151 (select (select .cse154 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse150 (mod (+ .cse152 1) .cse151))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse150 .cse151 1)) (= (mod .cse152 .cse151) 0) (< .cse153 0) (= .cse150 0) (< 0 (+ 2 .cse152)) (< 0 (+ .cse151 1)))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse158 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse155 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse158 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse156 (select (select .cse158 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse157 (mod .cse155 .cse156))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse155) .cse156) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse157 .cse156 1)) (= .cse157 0) (< 0 (+ .cse155 1)) (< (+ .cse156 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse157 1))))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse161 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse159 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse161 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse160 (select (select .cse161 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod (+ .cse159 1) .cse160) 0) (< 0 (+ 2 .cse159)) (< 0 (+ .cse160 1)) (< (+ .cse160 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse159 .cse160) 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse166 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse164 (select (select .cse166 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse165 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse164)) (.cse162 (select (select .cse166 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse163 (mod (+ .cse165 1) .cse162))) (or (< .cse162 0) (< (+ .cse162 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse163 1)) (< .cse164 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse165 .cse162) 1)) (= .cse163 0) (< 0 (+ 2 .cse165)))))))) (or .cse9 (forall ((v_ArrVal_1920 Int)) (let ((.cse169 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse167 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse169 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse168 (select (select .cse169 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse167 .cse168) 1)) (= (mod (+ .cse167 1) .cse168) 0) (< 0 (+ 2 .cse167)) (< 0 (+ .cse168 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse175 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse172 (select (select .cse175 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse170 (select (select .cse175 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse174 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse172))) (let ((.cse173 (+ .cse174 1)) (.cse171 (mod .cse174 .cse170))) (or (< .cse170 0) (= .cse171 0) (< .cse172 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse173 .cse170) 1)) (< 0 .cse173) (< (+ .cse170 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse171 1)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse179 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse178 (select (select .cse179 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse176 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse178)) (.cse177 (select (select .cse179 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod (+ .cse176 1) .cse177) 0) (< 0 (+ 2 .cse176)) (< 0 (+ .cse177 1)) (< (+ .cse177 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse176 .cse177) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse178) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse186 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse183 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse186 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse180 (+ .cse183 1)) (.cse182 (select (select .cse186 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse181 (mod .cse180 .cse182)) (.cse185 (+ .cse182 c_~last_1_WrapperStruct00_var_1_10~0)) (.cse184 (mod .cse183 .cse182))) (or (= .cse180 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse181 .cse182 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse183) .cse182) 1)) (= .cse184 0) (< .cse185 (+ .cse181 1)) (= .cse181 0) (< 0 .cse180) (< .cse185 (+ .cse184 1)))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse188 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse187 (select (select .cse188 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< 0 (+ 1 .cse187)) (< 0 (+ (div c_~last_1_WrapperStruct00_var_1_10~0 .cse187) 1)) (< 0 (+ (select (select .cse188 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1)))))) .cse9) (or .cse9 (and (or .cse4 (forall ((v_ArrVal_1920 Int)) (let ((.cse189 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (or (< 0 (+ (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse189 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 1)) (< 0 (+ (select (select .cse189 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse192 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse190 (select (select .cse192 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse191 (select (select .cse192 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< 0 (+ (div c_~last_1_WrapperStruct00_var_1_10~0 .cse190) 1)) (< 0 (+ .cse191 1)) (= 0 (mod (div 0 .cse190) .cse191)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse197 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse194 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse197 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse193 (select (select .cse197 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse195 (mod .cse194 .cse193)) (.cse196 (+ .cse194 1))) (or (< .cse193 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse194) .cse193) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse195 .cse193 1)) (= .cse195 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse196 .cse193) 1)) (< 0 .cse196)))))) (or (and (or (forall ((v_ArrVal_1920 Int)) (let ((.cse200 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse199 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse200 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse198 (select (select .cse200 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse198 0) (< 0 (+ .cse199 1)) (< (+ .cse198 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse199 .cse198) 1)))))) .cse4) (forall ((v_ArrVal_1920 Int)) (let ((.cse204 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse203 (select (select .cse204 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse202 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse203)) (.cse201 (select (select .cse204 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse201 0) (< 0 (+ .cse202 1)) (= 0 (mod (div 0 .cse203) .cse201)) (< (+ .cse201 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse202 .cse201) 1)))))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse209 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse207 (select (select .cse209 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse208 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse207)) (.cse206 (select (select .cse209 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse205 (mod .cse208 .cse206))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse205 .cse206 1)) (= .cse205 0) (< .cse207 0) (< 0 (+ .cse208 1)) (< 0 (+ .cse206 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse207) 0)))))))) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse214 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse213 (select (select .cse214 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse212 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse213))) (let ((.cse210 (+ .cse212 1)) (.cse211 (select (select .cse214 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= .cse210 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse210 .cse211) .cse211 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse212) .cse211) 1)) (< 0 .cse210) (< (+ .cse211 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse212 .cse211) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse213) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse219 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse218 (select (select .cse219 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse216 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse218))) (let ((.cse215 (+ .cse216 1)) (.cse217 (select (select .cse219 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= .cse215 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse216) .cse217) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse215 .cse217) 1)) (< 0 .cse215) (< (+ .cse217 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse216 .cse217) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse218) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse224 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse223 (select (select .cse224 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse220 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse223))) (let ((.cse222 (+ .cse220 1)) (.cse221 (select (select .cse224 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse220) .cse221) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse222 .cse221) 1)) (< 0 .cse222) (< (+ .cse221 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse220 .cse221) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse223) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse230 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse229 (select (select .cse230 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse227 (select (select .cse230 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse226 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse229))) (let ((.cse225 (+ .cse226 1)) (.cse228 (+ .cse227 c_~last_1_WrapperStruct00_var_1_10~0))) (or (= .cse225 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse226) .cse227) 1)) (< .cse228 (+ (mod .cse225 .cse227) 1)) (< 0 .cse225) (< .cse228 (+ (mod .cse226 .cse227) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse229) 0)))))))) .cse231) (or .cse9 (forall ((v_ArrVal_1920 Int)) (let ((.cse236 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse232 (select (select .cse236 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse235 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse236 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse234 (+ .cse235 1)) (.cse233 (mod .cse235 .cse232))) (or (< .cse232 0) (= .cse233 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse234 .cse232) 1)) (< 0 .cse234) (< (+ .cse232 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse233 1)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse240 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse239 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse240 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse238 (select (select .cse240 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse237 (mod (+ .cse239 1) .cse238))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse237 .cse238 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse239) .cse238) 1)) (< (+ .cse238 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse237 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse239 .cse238) 1)) (= .cse237 0) (< 0 (+ 2 .cse239))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse245 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse244 (select (select .cse245 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse243 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse244)) (.cse242 (select (select .cse245 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse241 (mod .cse243 .cse242))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse241 .cse242 1)) (= .cse241 0) (< 0 (+ .cse243 1)) (< 0 (+ .cse242 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse244) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse251 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse249 (select (select .cse251 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse248 (select (select .cse251 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse250 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse249))) (let ((.cse247 (+ .cse250 1)) (.cse246 (mod .cse250 .cse248))) (or (= .cse246 0) (= (mod .cse247 .cse248) 0) (< 0 .cse247) (< 0 (+ .cse248 1)) (< (+ .cse248 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse246 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse249) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse255 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse253 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse255 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse252 (select (select .cse255 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse254 (mod (+ .cse253 1) .cse252))) (or (< .cse252 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse253) .cse252) 1)) (< (+ .cse252 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse254 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse253 .cse252) 1)) (= .cse254 0) (< 0 (+ 2 .cse253))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse261 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse259 (select (select .cse261 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse256 (select (select .cse261 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse260 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse259))) (let ((.cse258 (+ .cse260 1)) (.cse257 (mod .cse260 .cse256))) (or (< .cse256 0) (= .cse257 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse258 .cse256) 1)) (< 0 .cse258) (< (+ .cse256 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse257 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse259) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse267 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse266 (select (select .cse267 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse264 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse266))) (let ((.cse265 (+ .cse264 1)) (.cse263 (select (select .cse267 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse262 (mod .cse265 .cse263))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse262 .cse263 1)) (= (mod .cse264 .cse263) 0) (= .cse262 0) (< 0 .cse265) (< 0 (+ .cse263 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse266) 0))))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse271 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse269 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse271 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse268 (select (select .cse271 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse270 (mod (+ .cse269 1) .cse268))) (or (< .cse268 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse269) .cse268) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse269 .cse268) .cse268 1)) (< (+ .cse268 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse270 1)) (= .cse270 0) (< 0 (+ 2 .cse269))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse274 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse273 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse274 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse272 (select (select .cse274 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse272 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse273) .cse272) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse273 .cse272) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse273 1) .cse272) 1)))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse278 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse275 (select (select .cse278 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse276 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse275)) (.cse277 (select (select .cse278 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse275 0) (= (mod (+ .cse276 1) .cse277) 0) (< 0 (+ 2 .cse276)) (< 0 (+ .cse277 1))))))) .cse24) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse282 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse281 (select (select .cse282 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse280 (select (select .cse282 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse279 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse281))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse279) .cse280) 1)) (< (+ .cse280 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod (+ .cse279 1) .cse280) 1)) (< 0 (+ 2 .cse279)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse281) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse286 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse285 (select (select .cse286 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse284 (select (select .cse286 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse283 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse285))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse283) .cse284) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse283 1) .cse284) 1)) (< 0 (+ 2 .cse283)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse285) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse290 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse289 (select (select .cse290 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse287 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse289)) (.cse288 (select (select .cse290 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse287) .cse288) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse287 1) .cse288) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse289) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse294 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse293 (select (select .cse294 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse292 (select (select .cse294 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse291 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse293))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse291 1) .cse292) .cse292 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse291) .cse292) 1)) (< 0 (+ 2 .cse291)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse293) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse296 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse295 (select (select .cse296 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) (div c_~last_1_WrapperStruct00_var_1_10~0 .cse295)) (select (select .cse296 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) 1)) (< 0 (+ 1 .cse295)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse295) 0)))))) .cse231) (forall ((v_ArrVal_1920 Int)) (let ((.cse300 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse299 (select (select .cse300 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse298 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse299)) (.cse297 (select (select .cse300 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse297 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse298 .cse297) .cse297 1)) (< .cse299 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse298 1) .cse297) 1))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse303 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse301 (select (select .cse303 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse302 (select (select .cse303 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse301) .cse302) 1)) (< 0 (+ 1 .cse301)) (< 0 (+ .cse302 1)))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse308 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse306 (select (select .cse308 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse307 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse306)) (.cse305 (select (select .cse308 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse304 (mod (+ .cse307 1) .cse305))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse304 .cse305 1)) (< (+ .cse305 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse304 1)) (< .cse306 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse307 .cse305) 1)) (= .cse304 0) (< 0 (+ 2 .cse307)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse316 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse314 (select (select .cse316 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse315 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse314))) (let ((.cse309 (+ .cse315 1)) (.cse310 (select (select .cse316 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse313 (mod .cse309 .cse310)) (.cse312 (+ .cse310 c_~last_1_WrapperStruct00_var_1_10~0)) (.cse311 (mod .cse315 .cse310))) (or (= .cse309 0) (< .cse310 0) (= .cse311 0) (< .cse312 (+ .cse313 1)) (< .cse314 0) (= .cse313 0) (< 0 .cse309) (< .cse312 (+ .cse311 1))))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse321 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse317 (select (select .cse321 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse318 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse321 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse320 (+ .cse318 1)) (.cse319 (mod .cse318 .cse317))) (or (< .cse317 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse318) .cse317) 1)) (= .cse319 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse320 .cse317) 1)) (< 0 .cse320) (< (+ .cse317 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse319 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse329 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse327 (select (select .cse329 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse328 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse327))) (let ((.cse322 (+ .cse328 1)) (.cse323 (select (select .cse329 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse326 (mod .cse322 .cse323)) (.cse325 (+ .cse323 c_~last_1_WrapperStruct00_var_1_10~0)) (.cse324 (mod .cse328 .cse323))) (or (= .cse322 0) (< .cse323 0) (= .cse324 0) (< .cse325 (+ .cse326 1)) (= .cse326 0) (< 0 .cse322) (< .cse325 (+ .cse324 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse327) 0))))))))) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse333 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse332 (select (select .cse333 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse331 (select (select .cse333 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse330 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse332))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse330) .cse331) 1)) (< (+ .cse331 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod (+ .cse330 1) .cse331) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse330 .cse331) 1)) (< 0 (+ 2 .cse330)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse332) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse337 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse336 (select (select .cse337 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse335 (select (select .cse337 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse334 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse336))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse334 1) .cse335) .cse335 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse334) .cse335) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse334 .cse335) 1)) (< 0 (+ 2 .cse334)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse336) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse341 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse340 (select (select .cse341 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse339 (select (select .cse341 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse338 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse340))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse338) .cse339) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse338 .cse339) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse338 1) .cse339) 1)) (< 0 (+ 2 .cse338)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse340) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse345 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse344 (select (select .cse345 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse342 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse344)) (.cse343 (select (select .cse345 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse342) .cse343) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse342 .cse343) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse342 1) .cse343) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse344) 0))))))) .cse231) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse349 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse348 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse349 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse347 (+ .cse348 1)) (.cse346 (select (select .cse349 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse346 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse347 .cse346) 1)) (< 0 .cse347) (< (+ .cse346 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse348 .cse346) 1))))))) .cse24) (or .cse24 (forall ((v_ArrVal_1920 Int)) (let ((.cse355 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse354 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse355 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse350 (+ .cse354 1)) (.cse351 (select (select .cse355 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse353 (mod .cse350 .cse351)) (.cse352 (+ .cse351 c_~last_1_WrapperStruct00_var_1_10~0))) (or (= .cse350 0) (< .cse351 0) (< .cse352 (+ .cse353 1)) (= .cse353 0) (< 0 .cse350) (< .cse352 (+ (mod .cse354 .cse351) 1))))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse359 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse358 (select (select .cse359 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse357 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse358)) (.cse356 (select (select .cse359 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse356 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse357 .cse356) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse357 1) .cse356) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse358) 0))))))) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse362 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse361 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse362 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse360 (select (select .cse362 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse360 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse361 .cse360) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse361 1) .cse360) 1)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse366 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse365 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse366 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse363 (select (select .cse366 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse364 (mod (+ .cse365 1) .cse363))) (or (< .cse363 0) (< (+ .cse363 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse364 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse365 .cse363) 1)) (= .cse364 0) (< 0 (+ 2 .cse365)))))))) .cse9) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse367 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse368 (select (select .cse367 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse367 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) .cse368) 1)) (< 0 (+ .cse368 1)))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse373 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse372 (select (select .cse373 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse369 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse372)) (.cse370 (select (select .cse373 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse371 (mod .cse369 .cse370))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse369) .cse370) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse371 .cse370 1)) (= .cse371 0) (< 0 (+ .cse369 1)) (< (+ .cse370 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse371 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse372) 0)))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse380 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse379 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse380 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse374 (+ .cse379 1)) (.cse375 (select (select .cse380 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse378 (mod .cse374 .cse375)) (.cse377 (+ .cse375 c_~last_1_WrapperStruct00_var_1_10~0)) (.cse376 (mod .cse379 .cse375))) (or (= .cse374 0) (< .cse375 0) (= .cse376 0) (< .cse377 (+ .cse378 1)) (= .cse378 0) (< 0 .cse374) (< .cse377 (+ .cse376 1)))))))) .cse9) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse384 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse383 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse384 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse382 (select (select .cse384 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse381 (mod .cse383 .cse382))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse381 .cse382 1)) (= .cse381 0) (< 0 (+ .cse383 1)) (< (+ .cse382 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse381 1))))))) .cse9) (forall ((v_ArrVal_1920 Int)) (let ((.cse389 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse387 (select (select .cse389 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse388 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse387)) (.cse385 (select (select .cse389 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse386 (mod (+ .cse388 1) .cse385))) (or (< (+ .cse385 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse386 1)) (< .cse387 0) (= .cse386 0) (< 0 (+ 2 .cse388)) (< 0 (+ .cse385 1)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse391 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse390 (select (select .cse391 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< 0 (+ 1 .cse390)) (< 0 (+ (div c_~last_1_WrapperStruct00_var_1_10~0 .cse390) 1)) (< 0 (+ (select (select .cse391 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse390) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse396 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse394 (select (select .cse396 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse395 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse394)) (.cse392 (select (select .cse396 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse393 (mod .cse395 .cse392))) (or (< .cse392 0) (= .cse393 0) (< .cse394 0) (< 0 (+ .cse395 1)) (< (+ .cse392 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse393 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse394) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse399 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse398 (select (select .cse399 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse397 (select (select .cse399 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse397) .cse398) 1)) (< 0 (+ .cse398 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse397) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse404 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse403 (select (select .cse404 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse402 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse403)) (.cse400 (select (select .cse404 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse401 (mod (+ .cse402 1) .cse400))) (or (< .cse400 0) (< (+ .cse400 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse401 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse402 .cse400) 1)) (= .cse401 0) (< 0 (+ 2 .cse402)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse403) 0)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse408 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse406 (select (select .cse408 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse407 (select (select .cse408 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse405 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse406) .cse407) 1))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 .cse405) (< 0 (+ 1 .cse406)) (< (+ .cse407 c_~last_1_WrapperStruct00_var_1_10~0) .cse405) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse406) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse413 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse412 (select (select .cse413 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse411 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse412)) (.cse409 (select (select .cse413 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse410 (mod .cse411 .cse409))) (or (< .cse409 0) (= .cse410 0) (< 0 (+ .cse411 1)) (< (+ .cse409 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse410 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse412) 0)))))))) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse417 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse415 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse417 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse414 (select (select .cse417 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse416 (mod (+ .cse415 1) .cse414))) (or (< .cse414 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse415 .cse414) .cse414 1)) (< (+ .cse414 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse416 1)) (= .cse416 0) (< 0 (+ 2 .cse415))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse421 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse420 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse421 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse419 (select (select .cse421 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse418 (mod (+ .cse420 1) .cse419))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse418 .cse419 1)) (< (+ .cse419 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse418 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse420 .cse419) 1)) (= .cse418 0) (< 0 (+ 2 .cse420))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse424 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse423 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse424 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse422 (select (select .cse424 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse422 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse423 .cse422) .cse422 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse423 1) .cse422) 1))))))) .cse9) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse428 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse427 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse428 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse425 (+ .cse427 1)) (.cse426 (select (select .cse428 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod .cse425 .cse426) 0) (< 0 .cse425) (< 0 (+ .cse426 1)) (< (+ .cse426 c_~last_1_WrapperStruct00_var_1_10~0) (+ (mod .cse427 .cse426) 1))))))) .cse24) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse431 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse430 (select (select .cse431 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse429 (mod (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse431 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) .cse430))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse429 .cse430 1)) (< (+ .cse430 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse429 1))))))) .cse9) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse434 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse432 (+ (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse434 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 1)) (.cse433 (select (select .cse434 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod .cse432 .cse433) 0) (< 0 .cse432) (< 0 (+ .cse433 1)))))) .cse24) (or .cse9 (forall ((v_ArrVal_1920 Int)) (let ((.cse438 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse435 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse438 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse437 (+ .cse435 1)) (.cse436 (select (select .cse438 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (= (mod .cse435 .cse436) 0) (= (mod .cse437 .cse436) 0) (< 0 .cse437) (< 0 (+ .cse436 1)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse442 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse440 (select (select .cse442 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse441 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse440)) (.cse439 (select (select .cse442 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< .cse439 0) (< .cse440 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse441 .cse439) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse441 1) .cse439) 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse446 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse445 (select (select .cse446 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) (.cse444 (select (select .cse446 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse443 (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse445) .cse444))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse443 .cse444 1)) (< (+ .cse444 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse443 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse445) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse454 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse452 (select (select .cse454 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse453 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse452))) (let ((.cse447 (+ .cse453 1)) (.cse449 (select (select .cse454 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse448 (mod .cse447 .cse449)) (.cse451 (+ .cse449 c_~last_1_WrapperStruct00_var_1_10~0)) (.cse450 (mod .cse453 .cse449))) (or (= .cse447 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse448 .cse449 1)) (= .cse450 0) (< .cse451 (+ .cse448 1)) (< .cse452 0) (= .cse448 0) (< 0 .cse447) (< .cse451 (+ .cse450 1))))))))) (or (and (forall ((v_ArrVal_1920 Int)) (let ((.cse459 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse458 (select (select .cse459 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse457 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse458)) (.cse456 (select (select .cse459 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse455 (mod (+ .cse457 1) .cse456))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse455 .cse456 1)) (= .cse455 0) (< 0 (+ 2 .cse457)) (< 0 (+ .cse456 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse458) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse464 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse463 (select (select .cse464 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse462 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse463)) (.cse460 (select (select .cse464 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse461 (mod (+ .cse462 1) .cse460))) (or (< (+ .cse460 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse461 1)) (= .cse461 0) (< 0 (+ 2 .cse462)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse463) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse469 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse468 (select (select .cse469 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse467 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse468)) (.cse466 (select (select .cse469 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse465 (mod (+ .cse467 1) .cse466))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse465 .cse466 1)) (< (+ .cse466 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse465 1)) (< 0 (+ 2 .cse467)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse468) 0))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse471 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse470 (select (select .cse471 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< .cse470 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (div c_~last_1_WrapperStruct00_var_1_10~0 .cse470) 1) (select (select .cse471 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) 1)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse470) 0))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse473 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse474 (select (select .cse473 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse472 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse474))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ .cse472 1) (select (select .cse473 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) 1)) (< 0 (+ 2 .cse472)) (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse474) 0))))))) .cse231) (forall ((v_ArrVal_1920 Int)) (let ((.cse479 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse478 (select (select .cse479 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse476 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse478)) (.cse475 (select (select .cse479 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse477 (mod (+ .cse476 1) .cse475))) (or (< .cse475 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse476 .cse475) .cse475 1)) (< (+ .cse475 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse477 1)) (< .cse478 0) (= .cse477 0) (< 0 (+ 2 .cse476)))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse482 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse481 (select (select .cse482 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)) (.cse480 (select (select .cse482 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (or (< .cse480 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (div c_~last_1_WrapperStruct00_var_1_10~0 .cse480) .cse481) 1)) (< 0 (+ .cse481 1)) (not (= (mod c_~last_1_WrapperStruct00_var_1_10~0 .cse480) 0)))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse486 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse483 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse486 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))) (let ((.cse485 (+ .cse483 1)) (.cse484 (select (select .cse486 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse483) .cse484) 1)) (= (mod .cse483 .cse484) 0) (= (mod .cse485 .cse484) 0) (< 0 .cse485) (< 0 (+ .cse484 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse490 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse489 (select (select .cse490 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse487 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse489)) (.cse488 (select (select .cse490 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse487) .cse488) 1)) (< 0 (+ 1 .cse489)) (< 0 (+ .cse487 1)) (< 0 (+ .cse488 1))))))) (forall ((v_ArrVal_1920 Int)) (let ((.cse496 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse493 (select (select .cse496 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse495 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse493)) (.cse491 (select (select .cse496 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse492 (mod .cse495 .cse491)) (.cse494 (+ .cse495 1))) (or (< .cse491 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse492 .cse491 1)) (= .cse492 0) (< .cse493 0) (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod .cse494 .cse491) 1)) (< 0 .cse494))))))) (or (forall ((v_ArrVal_1920 Int)) (let ((.cse500 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse499 (div c_~last_1_WrapperStruct00_var_1_10~0 (select (select .cse500 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (.cse498 (select (select .cse500 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse497 (mod .cse499 .cse498))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ .cse497 .cse498 1)) (< 0 (+ .cse499 1)) (< (+ .cse498 c_~last_1_WrapperStruct00_var_1_10~0) (+ .cse497 1))))))) .cse24) (forall ((v_ArrVal_1920 Int)) (let ((.cse505 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_1920)))) (let ((.cse504 (select (select .cse505 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) (let ((.cse501 (div c_~last_1_WrapperStruct00_var_1_10~0 .cse504)) (.cse502 (select (select .cse505 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (let ((.cse503 (+ (mod .cse501 .cse502) 1))) (or (< c_~last_1_WrapperStruct00_var_1_10~0 (+ (mod (+ (- 1) .cse501) .cse502) 1)) (< c_~last_1_WrapperStruct00_var_1_10~0 .cse503) (< 0 (+ 1 .cse504)) (< (+ .cse502 c_~last_1_WrapperStruct00_var_1_10~0) .cse503))))))))) is different from true