./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:34:47,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:34:47,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:34:47,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:34:47,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:34:47,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:34:47,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:34:47,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:34:47,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:34:47,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:34:47,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:34:47,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:34:47,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:34:47,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:34:47,907 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:34:47,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:34:47,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:34:47,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:34:47,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:34:47,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:34:47,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:34:47,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:34:47,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:34:47,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:34:47,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:34:47,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:47,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:34:47,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:34:47,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:34:47,911 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-02-05 14:34:48,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:34:48,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:34:48,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:34:48,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:34:48,185 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:34:48,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-05 14:34:49,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c931f17af/e8ce5363247f40fd94f4a1479a2048ab/FLAGec01762b3 [2025-02-05 14:34:49,775 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:34:49,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-05 14:34:49,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c931f17af/e8ce5363247f40fd94f4a1479a2048ab/FLAGec01762b3 [2025-02-05 14:34:49,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c931f17af/e8ce5363247f40fd94f4a1479a2048ab [2025-02-05 14:34:49,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:34:49,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:34:49,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:49,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:34:49,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:34:49,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:49" (1/1) ... [2025-02-05 14:34:49,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5976b9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:49, skipping insertion in model container [2025-02-05 14:34:49,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:49" (1/1) ... [2025-02-05 14:34:49,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:34:50,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-05 14:34:50,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-05 14:34:50,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-05 14:34:50,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-05 14:34:50,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-05 14:34:50,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-05 14:34:50,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:50,105 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:34:50,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-05 14:34:50,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-05 14:34:50,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-05 14:34:50,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-05 14:34:50,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-05 14:34:50,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-05 14:34:50,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:50,190 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:34:50,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50 WrapperNode [2025-02-05 14:34:50,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:50,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:50,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:34:50,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:34:50,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,222 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-02-05 14:34:50,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:50,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:34:50,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:34:50,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:34:50,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,253 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-05 14:34:50,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:34:50,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:34:50,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:34:50,265 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:34:50,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (1/1) ... [2025-02-05 14:34:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:50,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:34:50,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:34:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:34:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:34:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:34:50,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:34:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:34:50,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:34:50,395 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:34:50,397 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:34:50,578 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 14:34:50,579 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:34:50,588 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:34:50,589 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:34:50,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:50 BoogieIcfgContainer [2025-02-05 14:34:50,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:34:50,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:34:50,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:34:50,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:34:50,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:34:49" (1/3) ... [2025-02-05 14:34:50,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2204d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:50, skipping insertion in model container [2025-02-05 14:34:50,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:50" (2/3) ... [2025-02-05 14:34:50,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2204d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:50, skipping insertion in model container [2025-02-05 14:34:50,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:50" (3/3) ... [2025-02-05 14:34:50,599 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-02-05 14:34:50,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:34:50,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 1 procedures, 46 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-02-05 14:34:50,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:34:50,673 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;@404d246c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:34:50,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-05 14:34:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 45 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:34:50,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:50,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:50,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:50,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash -977920417, now seen corresponding path program 1 times [2025-02-05 14:34:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477833082] [2025-02-05 14:34:50,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:34:50,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:34:50,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:50,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477833082] [2025-02-05 14:34:51,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477833082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:51,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:34:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400088775] [2025-02-05 14:34:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:51,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:34:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:51,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:34:51,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:34:51,214 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 45 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:51,323 INFO L93 Difference]: Finished difference Result 88 states and 134 transitions. [2025-02-05 14:34:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:34:51,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-05 14:34:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:51,331 INFO L225 Difference]: With dead ends: 88 [2025-02-05 14:34:51,331 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 14:34:51,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:34:51,335 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:51,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 14:34:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-05 14:34:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-02-05 14:34:51,366 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 7 [2025-02-05 14:34:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:51,366 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-02-05 14:34:51,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-02-05 14:34:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:34:51,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:51,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:34:51,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:51,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -251900837, now seen corresponding path program 1 times [2025-02-05 14:34:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516926555] [2025-02-05 14:34:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:51,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:34:51,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:34:51,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516926555] [2025-02-05 14:34:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516926555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:34:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018969191] [2025-02-05 14:34:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:34:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:51,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:34:51,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:34:51,510 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:51,586 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2025-02-05 14:34:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:34:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:34:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:51,588 INFO L225 Difference]: With dead ends: 59 [2025-02-05 14:34:51,589 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 14:34:51,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:34:51,590 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:51,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 14:34:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2025-02-05 14:34:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-02-05 14:34:51,599 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 8 [2025-02-05 14:34:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:51,599 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-02-05 14:34:51,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-02-05 14:34:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 14:34:51,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:51,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:51,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:34:51,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:51,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash -868902221, now seen corresponding path program 1 times [2025-02-05 14:34:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:51,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475212845] [2025-02-05 14:34:51,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:51,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 14:34:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 14:34:51,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:52,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475212845] [2025-02-05 14:34:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475212845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:52,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:34:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14509863] [2025-02-05 14:34:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:52,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:34:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:52,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:34:52,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:34:52,141 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:52,386 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2025-02-05 14:34:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:34:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 14:34:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:52,388 INFO L225 Difference]: With dead ends: 57 [2025-02-05 14:34:52,388 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 14:34:52,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:34:52,389 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:52,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 113 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 14:34:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-02-05 14:34:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-05 14:34:52,403 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2025-02-05 14:34:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:52,404 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-05 14:34:52,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-05 14:34:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 14:34:52,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:52,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:34:52,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:52,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash -868881367, now seen corresponding path program 1 times [2025-02-05 14:34:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302778781] [2025-02-05 14:34:52,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:52,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 14:34:52,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 14:34:52,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:52,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:52,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302778781] [2025-02-05 14:34:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302778781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:52,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:34:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392435807] [2025-02-05 14:34:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:34:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:34:52,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:34:52,483 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:52,561 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-02-05 14:34:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:34:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 14:34:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:52,562 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:34:52,562 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 14:34:52,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:34:52,565 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:52,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 100 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 14:34:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-05 14:34:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-05 14:34:52,574 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2025-02-05 14:34:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:52,574 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-05 14:34:52,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-05 14:34:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:34:52,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:52,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:52,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:34:52,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1421441085, now seen corresponding path program 1 times [2025-02-05 14:34:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118215131] [2025-02-05 14:34:52,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:52,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:34:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:34:52,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:52,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118215131] [2025-02-05 14:34:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118215131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:34:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506090528] [2025-02-05 14:34:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:53,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:34:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:53,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:34:53,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:34:53,140 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:53,303 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2025-02-05 14:34:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:34:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 14:34:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:53,304 INFO L225 Difference]: With dead ends: 69 [2025-02-05 14:34:53,304 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 14:34:53,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:34:53,305 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:53,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 14:34:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2025-02-05 14:34:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2025-02-05 14:34:53,321 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2025-02-05 14:34:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:53,321 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2025-02-05 14:34:53,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2025-02-05 14:34:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:34:53,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:53,322 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:34:53,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:53,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash -349152393, now seen corresponding path program 1 times [2025-02-05 14:34:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303160641] [2025-02-05 14:34:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:53,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:34:53,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:34:53,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:53,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:53,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303160641] [2025-02-05 14:34:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303160641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:34:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652440925] [2025-02-05 14:34:53,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:53,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:34:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:53,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:34:53,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:34:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:34:53,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:34:53,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:53,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:53,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 14:34:53,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:34:54,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:34:54,051 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 11 treesize of output 7 [2025-02-05 14:34:54,149 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:34:54,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 18 [2025-02-05 14:34:54,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-02-05 14:34:54,210 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:34:54,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:34:54,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2025-02-05 14:34:54,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-05 14:34:54,250 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 30 treesize of output 22 [2025-02-05 14:34:54,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2025-02-05 14:34:54,285 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:34:54,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:34:54,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,553 INFO L349 Elim1Store]: treesize reduction 988, result has 2.1 percent of original size [2025-02-05 14:34:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 528 treesize of output 656 [2025-02-05 14:34:54,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2025-02-05 14:34:54,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-02-05 14:34:54,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:54,639 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:34:54,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2025-02-05 14:34:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:54,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:34:54,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:54,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-02-05 14:34:54,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:54,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-02-05 14:34:55,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:55,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-02-05 14:34:55,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:55,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2025-02-05 14:34:56,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:56,836 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1767 treesize of output 1408 [2025-02-05 14:34:56,851 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 2855 treesize of output 2235 [2025-02-05 14:34:56,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2083 treesize of output 1991 [2025-02-05 14:34:56,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1993 treesize of output 1987 [2025-02-05 14:34:56,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1987 treesize of output 1977 [2025-02-05 14:35:04,835 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse4 (store v_ArrVal_337 8 2))) (let ((.cse1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse1 1) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse1 0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse7 (store .cse6 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 1) (= .cse5 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse11 (store .cse10 v_arrayElimCell_17 v_ArrVal_338)) (.cse9 (store v_ArrVal_337 8 2))) (let ((.cse8 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse17 (store v_prenex_19 8 2)) (.cse16 (store .cse18 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse18 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse16 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse15 (select (select (store (store (store .cse18 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse14 (select (select (store .cse16 v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse13) (= .cse14 1) (= .cse15 0) (= .cse13 1) (= .cse15 1) (= .cse14 0)))))) (= v_prenex_20 v_arrayElimCell_17))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_16) 0)) (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse20 (select (select (store (store .cse22 v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse21 (select (select (store (store (store .cse22 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse20 0) (= 0 .cse21) (= .cse20 1) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_6 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= v_prenex_25 v_arrayElimCell_17) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse25 (select (select (store (store .cse24 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse23 (select (select (store (store (store .cse24 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse23 1) (= .cse23 0)))) (= .cse25 0) (= .cse25 1))))) (not (= 2 (select v_arrayElimArr_7 8))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse26 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse26 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse26 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse29 (store v_ArrVal_337 8 2))) (let ((.cse27 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse27 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse27 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17)))))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse32 (store .cse31 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse30 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse35 (store .cse34 v_arrayElimCell_16 v_prenex_32))) (let ((.cse33 (select (select (store .cse35 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (= .cse33 1) (= (select (select (store (store .cse34 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse35 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (and (forall ((v_prenex_20 Int)) (or (not (= (select .cse0 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse40 (store .cse39 v_arrayElimCell_17 v_prenex_21)) (.cse41 (store v_prenex_19 8 2))) (let ((.cse36 (select (select (store .cse40 v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse37 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse38 (select (select (store (store .cse39 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse40 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse36 1) (= .cse36 0) (= .cse37 0) (= .cse38 1) (= .cse37 1) (= .cse38 0) (= v_prenex_20 v_arrayElimCell_17)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse45 (store .cse44 v_arrayElimCell_17 v_prenex_21))) (let ((.cse42 (select (select (store .cse45 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse43 (select (select (store (store .cse44 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse45 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse42 1) (= .cse42 0) (= .cse43 1) (= .cse43 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse49 (store .cse48 v_arrayElimCell_17 v_prenex_21)) (.cse51 (store v_prenex_19 8 2))) (let ((.cse46 (select (select (store .cse49 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse47 (select (select (store .cse50 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse46 1) (= .cse46 0) (= .cse47 0) (= .cse47 1) (= (select (select (store (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse49 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse50 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse56 (store .cse55 v_arrayElimCell_17 v_prenex_21)) (.cse54 (store v_prenex_19 8 2))) (let ((.cse52 (select (select (store .cse56 v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse53 (select (select (store (store .cse55 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse56 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= .cse52 0) (= .cse53 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse53 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse57 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse58 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse57 1) (= .cse58 0) (= .cse57 0) (= .cse59 0) (= .cse59 1) (= .cse58 1))))) (= v_prenex_20 v_arrayElimCell_17))) (not (= (select .cse0 v_prenex_20) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse62 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse62 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse62 0)))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse63 (store v_prenex_22 8 2)) (.cse66 (store .cse67 v_arrayElimCell_17 v_prenex_24))) (let ((.cse64 (select (select (store (store .cse67 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse66 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (select (select (store .cse66 v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse64 1) (= .cse65 0) (= .cse64 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse65 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse70 (store .cse69 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse68 (select (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse68 0) (= .cse68 1) (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse73 (store .cse72 v_arrayElimCell_17 v_prenex_32)) (.cse71 (store v_prenex_30 8 2))) (let ((.cse74 (select (select (store .cse73 v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse72 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse73 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse74 0) (= .cse74 1))))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse75 1) (= .cse75 0)))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse78 (store .cse77 v_arrayElimCell_17 v_prenex_29)) (.cse79 (store v_prenex_27 8 2))) (let ((.cse76 (select (select (store .cse78 v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse76 1) (= .cse76 0) (= (select (select (store (store .cse77 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse78 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse78 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse83 (store .cse82 v_arrayElimCell_17 v_prenex_21)) (.cse85 (store v_prenex_19 8 2))) (let ((.cse80 (select (select (store .cse83 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse81 (select (select (store .cse84 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse80 1) (= .cse80 0) (= .cse81 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse81 1) (= (select (select (store (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse84 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int)) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse89 (store .cse87 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse90 (store .cse89 v_arrayElimCell_17 v_prenex_24)) (.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse92 (store v_prenex_22 8 2))) (let ((.cse86 (select (select (store .cse88 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse91 (select (select (store .cse90 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse86 0) (= .cse86 1) (= (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse89 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse90 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse91 1) (= .cse91 0))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse95 (store .cse96 v_arrayElimCell_16 v_prenex_21))) (let ((.cse93 (select (select (store (store .cse96 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse95 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse94 (select (select (store .cse95 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse93) (= .cse94 1) (= .cse93 1) (= .cse94 0)))))) (= v_prenex_20 v_arrayElimCell_16))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse98 (store .cse97 v_arrayElimCell_17 v_prenex_32))) (let ((.cse99 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse99 0) (= .cse99 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (forall ((v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse104 (store .cse103 v_arrayElimCell_16 v_prenex_29)) (.cse102 (store v_prenex_27 8 2))) (let ((.cse101 (select (select (store .cse104 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (store (store .cse103 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse100 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse101 0) (= .cse101 1) (= (select (select (store .cse100 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse103 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse104 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse107 (store .cse108 v_arrayElimCell_16 v_prenex_21))) (let ((.cse105 (select (select (store (store .cse108 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse107 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse106 (select (select (store .cse107 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse105) (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (= .cse106 1) (= .cse105 1) (= .cse106 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse113 (store .cse112 v_arrayElimCell_17 v_prenex_21)) (.cse111 (store v_prenex_19 8 2))) (let ((.cse109 (select (select (store .cse113 v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse110 (select (select (store (store .cse112 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse113 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse109 1) (= .cse109 0) (= .cse110 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse110 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse116 (store .cse115 v_arrayElimCell_16 v_ArrVal_338)) (.cse118 (store v_ArrVal_337 8 2))) (let ((.cse114 (select (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse117 (select (select (store (store (store .cse115 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse114 0) (= .cse114 1) (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse117 0) (= .cse117 1)))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse122 (store .cse121 v_arrayElimCell_17 v_prenex_21))) (let ((.cse119 (select (select (store .cse122 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse120 (select (select (store (store .cse121 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse122 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse119 1) (= .cse119 0) (= .cse120 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse120 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_31 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse124 (store .cse128 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse125 (store .cse124 v_arrayElimCell_17 v_prenex_32)) (.cse127 (store v_prenex_30 8 2))) (let ((.cse123 (select (select (store (store .cse128 v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse126 (select (select (store .cse125 v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse123 1) (= (select (select (store (store .cse124 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse125 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse123 0) (= .cse126 1) (= .cse126 0))))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse129 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse129 1) (= .cse129 0)))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse130 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse130 0) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse130 1)))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse134 (store .cse133 v_arrayElimCell_17 v_ArrVal_338)) (.cse132 (store v_ArrVal_337 8 2))) (let ((.cse131 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse131 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse133 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse136 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse137 (store .cse136 v_arrayElimCell_16 v_ArrVal_338)) (.cse139 (store v_ArrVal_337 8 2))) (let ((.cse135 (select (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse138 (select (select (store (store (store .cse136 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse135 0) (= .cse135 1) (= (select (select (store (store .cse136 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse138 0) (= .cse138 1)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse143 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse144 (store .cse143 v_arrayElimCell_17 v_prenex_21)) (.cse145 (store v_prenex_19 8 2))) (let ((.cse140 (select (select (store .cse144 v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse142 (select (select (store (store .cse143 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse144 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse140 1) (= .cse140 0) (= .cse141 0) (= .cse142 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse141 1) (= .cse142 0) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse146 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse146 1) (= .cse146 0))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse147 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse147 0) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)) (= .cse147 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse148 (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse148 0) (not (= (select .cse0 v_arrayElimCell_17) 0)) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (= .cse148 1) (not (= (select v_arrayElimArr_9 12) 2)) (= (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse152 (store .cse151 v_arrayElimCell_16 v_prenex_29))) (let ((.cse150 (select (select (store .cse152 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse150 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (= .cse150 1) (= (select (select (store (store .cse151 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse152 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store .cse152 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse153 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_arrayElimCell_17) 0)) (= .cse153 0) (= .cse153 1) (not (= (select v_arrayElimArr_10 12) 2)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_prenex_24))) (let ((.cse154 (select (select (store .cse157 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse157 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 0) (= .cse154 1) (= .cse155 0) (= .cse155 1) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse160 (select (select (store (store .cse159 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse158 (select (select (store (store (store .cse159 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse158 1) (= .cse158 0)))) (= .cse160 0) (= .cse160 1))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse162 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse161 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 0) (= .cse161 1) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse166 (store .cse167 v_arrayElimCell_17 v_prenex_24))) (let ((.cse164 (select (select (store (store .cse167 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse166 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse165 (select (select (store .cse166 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse164 1) (= .cse165 0) (= .cse164 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse165 1)))))) .cse12) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse0 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse168 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse168 1) (= .cse168 0)))))) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse169 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse169 1) (= .cse169 0)))) (not (= 0 (select .cse0 v_prenex_25)))))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse172 (store .cse171 v_arrayElimCell_17 v_prenex_29))) (let ((.cse170 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse170 1) (= .cse170 0) (= (select (select (store (store .cse171 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse172 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse176 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse177 (store .cse176 v_arrayElimCell_17 v_prenex_24)) (.cse174 (store v_prenex_22 8 2))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse175 (select (select (store .cse177 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store .cse173 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse175 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse173 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse176 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse177 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse175 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse183 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse182 (store v_prenex_19 8 2)) (.cse181 (store .cse183 v_arrayElimCell_16 v_prenex_21))) (let ((.cse178 (select (select (store (store .cse183 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse181 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse180 (select (select (store (store (store .cse183 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store .cse181 v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse178) (= .cse179 1) (= .cse180 0) (= .cse178 1) (= .cse180 1) (= .cse179 0)))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse187 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332)) (.cse185 (store v_prenex_27 8 2))) (let ((.cse186 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (store .cse187 v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse184 v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 0) (= (select (select (store (store .cse187 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse184 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 1) (= 0 (select (select (store .cse184 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0)))))) .cse12))) is different from true [2025-02-05 14:35:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-05 14:35:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652440925] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:35:07,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:35:07,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 14 [2025-02-05 14:35:07,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232304959] [2025-02-05 14:35:07,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:35:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 14:35:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:35:07,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 14:35:07,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2025-02-05 14:35:07,291 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:11,446 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse4 (store v_ArrVal_337 8 2))) (let ((.cse1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse1 1) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse1 0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse7 (store .cse6 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 1) (= .cse5 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse11 (store .cse10 v_arrayElimCell_17 v_ArrVal_338)) (.cse9 (store v_ArrVal_337 8 2))) (let ((.cse8 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse17 (store v_prenex_19 8 2)) (.cse16 (store .cse18 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse18 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse16 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse15 (select (select (store (store (store .cse18 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse14 (select (select (store .cse16 v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse13) (= .cse14 1) (= .cse15 0) (= .cse13 1) (= .cse15 1) (= .cse14 0)))))) (= v_prenex_20 v_arrayElimCell_17))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_16) 0)) (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse20 (select (select (store (store .cse22 v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse21 (select (select (store (store (store .cse22 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse20 0) (= 0 .cse21) (= .cse20 1) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_6 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= v_prenex_25 v_arrayElimCell_17) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse25 (select (select (store (store .cse24 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse23 (select (select (store (store (store .cse24 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse23 1) (= .cse23 0)))) (= .cse25 0) (= .cse25 1))))) (not (= 2 (select v_arrayElimArr_7 8))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse26 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse26 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse26 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse29 (store v_ArrVal_337 8 2))) (let ((.cse27 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse27 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse27 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17)))))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse32 (store .cse31 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse30 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse35 (store .cse34 v_arrayElimCell_16 v_prenex_32))) (let ((.cse33 (select (select (store .cse35 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (= .cse33 1) (= (select (select (store (store .cse34 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse35 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (and (forall ((v_prenex_20 Int)) (or (not (= (select .cse0 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse40 (store .cse39 v_arrayElimCell_17 v_prenex_21)) (.cse41 (store v_prenex_19 8 2))) (let ((.cse36 (select (select (store .cse40 v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse37 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse38 (select (select (store (store .cse39 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse40 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse36 1) (= .cse36 0) (= .cse37 0) (= .cse38 1) (= .cse37 1) (= .cse38 0) (= v_prenex_20 v_arrayElimCell_17)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse45 (store .cse44 v_arrayElimCell_17 v_prenex_21))) (let ((.cse42 (select (select (store .cse45 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse43 (select (select (store (store .cse44 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse45 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse42 1) (= .cse42 0) (= .cse43 1) (= .cse43 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse49 (store .cse48 v_arrayElimCell_17 v_prenex_21)) (.cse51 (store v_prenex_19 8 2))) (let ((.cse46 (select (select (store .cse49 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse47 (select (select (store .cse50 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse46 1) (= .cse46 0) (= .cse47 0) (= .cse47 1) (= (select (select (store (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse49 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse50 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse56 (store .cse55 v_arrayElimCell_17 v_prenex_21)) (.cse54 (store v_prenex_19 8 2))) (let ((.cse52 (select (select (store .cse56 v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse53 (select (select (store (store .cse55 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse56 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= .cse52 0) (= .cse53 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse53 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse57 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse58 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse57 1) (= .cse58 0) (= .cse57 0) (= .cse59 0) (= .cse59 1) (= .cse58 1))))) (= v_prenex_20 v_arrayElimCell_17))) (not (= (select .cse0 v_prenex_20) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse62 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse62 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse62 0)))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse63 (store v_prenex_22 8 2)) (.cse66 (store .cse67 v_arrayElimCell_17 v_prenex_24))) (let ((.cse64 (select (select (store (store .cse67 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse66 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (select (select (store .cse66 v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse64 1) (= .cse65 0) (= .cse64 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse65 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse70 (store .cse69 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse68 (select (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse68 0) (= .cse68 1) (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse73 (store .cse72 v_arrayElimCell_17 v_prenex_32)) (.cse71 (store v_prenex_30 8 2))) (let ((.cse74 (select (select (store .cse73 v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse72 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse73 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse74 0) (= .cse74 1))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse75 1) (= .cse75 0)))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse78 (store .cse77 v_arrayElimCell_17 v_prenex_29)) (.cse79 (store v_prenex_27 8 2))) (let ((.cse76 (select (select (store .cse78 v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse76 1) (= .cse76 0) (= (select (select (store (store .cse77 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse78 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse78 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse83 (store .cse82 v_arrayElimCell_17 v_prenex_21)) (.cse85 (store v_prenex_19 8 2))) (let ((.cse80 (select (select (store .cse83 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse81 (select (select (store .cse84 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse80 1) (= .cse80 0) (= .cse81 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse81 1) (= (select (select (store (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse84 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int)) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse89 (store .cse87 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse90 (store .cse89 v_arrayElimCell_17 v_prenex_24)) (.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse92 (store v_prenex_22 8 2))) (let ((.cse86 (select (select (store .cse88 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse91 (select (select (store .cse90 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse86 0) (= .cse86 1) (= (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse89 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse90 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse91 1) (= .cse91 0))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse95 (store .cse96 v_arrayElimCell_16 v_prenex_21))) (let ((.cse93 (select (select (store (store .cse96 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse95 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse94 (select (select (store .cse95 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse93) (= .cse94 1) (= .cse93 1) (= .cse94 0)))))) (= v_prenex_20 v_arrayElimCell_16))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse98 (store .cse97 v_arrayElimCell_17 v_prenex_32))) (let ((.cse99 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse99 0) (= .cse99 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (forall ((v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse104 (store .cse103 v_arrayElimCell_16 v_prenex_29)) (.cse102 (store v_prenex_27 8 2))) (let ((.cse101 (select (select (store .cse104 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (store (store .cse103 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse100 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse101 0) (= .cse101 1) (= (select (select (store .cse100 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse103 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse104 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse107 (store .cse108 v_arrayElimCell_16 v_prenex_21))) (let ((.cse105 (select (select (store (store .cse108 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse107 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse106 (select (select (store .cse107 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse105) (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (= .cse106 1) (= .cse105 1) (= .cse106 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse113 (store .cse112 v_arrayElimCell_17 v_prenex_21)) (.cse111 (store v_prenex_19 8 2))) (let ((.cse109 (select (select (store .cse113 v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse110 (select (select (store (store .cse112 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse113 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse109 1) (= .cse109 0) (= .cse110 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse110 0) (= v_prenex_20 v_arrayElimCell_17))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse116 (store .cse115 v_arrayElimCell_16 v_ArrVal_338)) (.cse118 (store v_ArrVal_337 8 2))) (let ((.cse114 (select (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse117 (select (select (store (store (store .cse115 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse114 0) (= .cse114 1) (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse117 0) (= .cse117 1)))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse122 (store .cse121 v_arrayElimCell_17 v_prenex_21))) (let ((.cse119 (select (select (store .cse122 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse120 (select (select (store (store .cse121 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse122 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse119 1) (= .cse119 0) (= .cse120 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse120 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_31 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse124 (store .cse128 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse125 (store .cse124 v_arrayElimCell_17 v_prenex_32)) (.cse127 (store v_prenex_30 8 2))) (let ((.cse123 (select (select (store (store .cse128 v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse126 (select (select (store .cse125 v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse123 1) (= (select (select (store (store .cse124 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse125 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse123 0) (= .cse126 1) (= .cse126 0))))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse129 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse129 1) (= .cse129 0)))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse130 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse130 0) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse130 1)))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse134 (store .cse133 v_arrayElimCell_17 v_ArrVal_338)) (.cse132 (store v_ArrVal_337 8 2))) (let ((.cse131 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse131 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse133 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse136 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse137 (store .cse136 v_arrayElimCell_16 v_ArrVal_338)) (.cse139 (store v_ArrVal_337 8 2))) (let ((.cse135 (select (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse138 (select (select (store (store (store .cse136 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse135 0) (= .cse135 1) (= (select (select (store (store .cse136 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse138 0) (= .cse138 1)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse143 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse144 (store .cse143 v_arrayElimCell_17 v_prenex_21)) (.cse145 (store v_prenex_19 8 2))) (let ((.cse140 (select (select (store .cse144 v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse142 (select (select (store (store .cse143 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse144 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse140 1) (= .cse140 0) (= .cse141 0) (= .cse142 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse141 1) (= .cse142 0) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse146 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse146 1) (= .cse146 0))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse147 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse147 0) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)) (= .cse147 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse148 (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse148 0) (not (= (select .cse0 v_arrayElimCell_17) 0)) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (= .cse148 1) (not (= (select v_arrayElimArr_9 12) 2)) (= (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse152 (store .cse151 v_arrayElimCell_16 v_prenex_29))) (let ((.cse150 (select (select (store .cse152 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse150 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (= .cse150 1) (= (select (select (store (store .cse151 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse152 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store .cse152 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse153 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_arrayElimCell_17) 0)) (= .cse153 0) (= .cse153 1) (not (= (select v_arrayElimArr_10 12) 2)))))) (= (select .cse19 8) 0) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_prenex_24))) (let ((.cse154 (select (select (store .cse157 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse157 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 0) (= .cse154 1) (= .cse155 0) (= .cse155 1) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse160 (select (select (store (store .cse159 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse158 (select (select (store (store (store .cse159 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse158 1) (= .cse158 0)))) (= .cse160 0) (= .cse160 1))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse162 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse161 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 0) (= .cse161 1) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse166 (store .cse167 v_arrayElimCell_17 v_prenex_24))) (let ((.cse164 (select (select (store (store .cse167 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse166 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse165 (select (select (store .cse166 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse164 1) (= .cse165 0) (= .cse164 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse165 1)))))) .cse12) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse0 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse168 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse168 1) (= .cse168 0)))))) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse169 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse169 1) (= .cse169 0)))) (not (= 0 (select .cse0 v_prenex_25)))))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse172 (store .cse171 v_arrayElimCell_17 v_prenex_29))) (let ((.cse170 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse170 1) (= .cse170 0) (= (select (select (store (store .cse171 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse172 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse176 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse177 (store .cse176 v_arrayElimCell_17 v_prenex_24)) (.cse174 (store v_prenex_22 8 2))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse175 (select (select (store .cse177 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store .cse173 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse175 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse173 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse176 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse177 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse175 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse183 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse182 (store v_prenex_19 8 2)) (.cse181 (store .cse183 v_arrayElimCell_16 v_prenex_21))) (let ((.cse178 (select (select (store (store .cse183 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse181 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse180 (select (select (store (store (store .cse183 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store .cse181 v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse178) (= .cse179 1) (= .cse180 0) (= .cse178 1) (= .cse180 1) (= .cse179 0)))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse187 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332)) (.cse185 (store v_prenex_27 8 2))) (let ((.cse186 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (store .cse187 v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse184 v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 0) (= (select (select (store (store .cse187 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse184 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 1) (= 0 (select (select (store .cse184 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0)))))) .cse12))) is different from true [2025-02-05 14:35:15,546 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse4 (store v_ArrVal_337 8 2))) (let ((.cse1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse1 1) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse1 0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse7 (store .cse6 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 1) (= .cse5 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse11 (store .cse10 v_arrayElimCell_17 v_ArrVal_338)) (.cse9 (store v_ArrVal_337 8 2))) (let ((.cse8 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse17 (store v_prenex_19 8 2)) (.cse16 (store .cse18 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse18 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse16 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse15 (select (select (store (store (store .cse18 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse14 (select (select (store .cse16 v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse13) (= .cse14 1) (= .cse15 0) (= .cse13 1) (= .cse15 1) (= .cse14 0)))))) (= v_prenex_20 v_arrayElimCell_17))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_16) 0)) (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse20 (select (select (store (store .cse22 v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse21 (select (select (store (store (store .cse22 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse20 0) (= 0 .cse21) (= .cse20 1) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_6 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= v_prenex_25 v_arrayElimCell_17) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse25 (select (select (store (store .cse24 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse23 (select (select (store (store (store .cse24 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse23 1) (= .cse23 0)))) (= .cse25 0) (= .cse25 1))))) (not (= 2 (select v_arrayElimArr_7 8))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse26 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse26 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse26 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse29 (store v_ArrVal_337 8 2))) (let ((.cse27 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse27 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse27 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17)))))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse32 (store .cse31 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse30 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse35 (store .cse34 v_arrayElimCell_16 v_prenex_32))) (let ((.cse33 (select (select (store .cse35 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (= .cse33 1) (= (select (select (store (store .cse34 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse35 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (and (forall ((v_prenex_20 Int)) (or (not (= (select .cse0 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse40 (store .cse39 v_arrayElimCell_17 v_prenex_21)) (.cse41 (store v_prenex_19 8 2))) (let ((.cse36 (select (select (store .cse40 v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse37 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse38 (select (select (store (store .cse39 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse40 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse36 1) (= .cse36 0) (= .cse37 0) (= .cse38 1) (= .cse37 1) (= .cse38 0) (= v_prenex_20 v_arrayElimCell_17)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse45 (store .cse44 v_arrayElimCell_17 v_prenex_21))) (let ((.cse42 (select (select (store .cse45 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse43 (select (select (store (store .cse44 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse45 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse42 1) (= .cse42 0) (= .cse43 1) (= .cse43 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse49 (store .cse48 v_arrayElimCell_17 v_prenex_21)) (.cse51 (store v_prenex_19 8 2))) (let ((.cse46 (select (select (store .cse49 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse47 (select (select (store .cse50 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse46 1) (= .cse46 0) (= .cse47 0) (= .cse47 1) (= (select (select (store (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse49 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse50 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse56 (store .cse55 v_arrayElimCell_17 v_prenex_21)) (.cse54 (store v_prenex_19 8 2))) (let ((.cse52 (select (select (store .cse56 v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse53 (select (select (store (store .cse55 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse56 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= .cse52 0) (= .cse53 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse53 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse57 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse58 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse57 1) (= .cse58 0) (= .cse57 0) (= .cse59 0) (= .cse59 1) (= .cse58 1))))) (= v_prenex_20 v_arrayElimCell_17))) (not (= (select .cse0 v_prenex_20) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse62 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse62 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse62 0)))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse63 (store v_prenex_22 8 2)) (.cse66 (store .cse67 v_arrayElimCell_17 v_prenex_24))) (let ((.cse64 (select (select (store (store .cse67 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse66 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (select (select (store .cse66 v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse64 1) (= .cse65 0) (= .cse64 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse65 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse70 (store .cse69 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse68 (select (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse68 0) (= .cse68 1) (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse73 (store .cse72 v_arrayElimCell_17 v_prenex_32)) (.cse71 (store v_prenex_30 8 2))) (let ((.cse74 (select (select (store .cse73 v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse72 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse73 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse74 0) (= .cse74 1))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse75 1) (= .cse75 0)))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse78 (store .cse77 v_arrayElimCell_17 v_prenex_29)) (.cse79 (store v_prenex_27 8 2))) (let ((.cse76 (select (select (store .cse78 v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse76 1) (= .cse76 0) (= (select (select (store (store .cse77 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse78 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse78 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse83 (store .cse82 v_arrayElimCell_17 v_prenex_21)) (.cse85 (store v_prenex_19 8 2))) (let ((.cse80 (select (select (store .cse83 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse81 (select (select (store .cse84 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse80 1) (= .cse80 0) (= .cse81 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse81 1) (= (select (select (store (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse84 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int)) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse89 (store .cse87 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse90 (store .cse89 v_arrayElimCell_17 v_prenex_24)) (.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse92 (store v_prenex_22 8 2))) (let ((.cse86 (select (select (store .cse88 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse91 (select (select (store .cse90 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse86 0) (= .cse86 1) (= (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse89 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse90 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse91 1) (= .cse91 0))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse95 (store .cse96 v_arrayElimCell_16 v_prenex_21))) (let ((.cse93 (select (select (store (store .cse96 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse95 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse94 (select (select (store .cse95 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse93) (= .cse94 1) (= .cse93 1) (= .cse94 0)))))) (= v_prenex_20 v_arrayElimCell_16))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse98 (store .cse97 v_arrayElimCell_17 v_prenex_32))) (let ((.cse99 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse99 0) (= .cse99 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (forall ((v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse104 (store .cse103 v_arrayElimCell_16 v_prenex_29)) (.cse102 (store v_prenex_27 8 2))) (let ((.cse101 (select (select (store .cse104 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (store (store .cse103 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse100 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse101 0) (= .cse101 1) (= (select (select (store .cse100 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse103 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse104 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse107 (store .cse108 v_arrayElimCell_16 v_prenex_21))) (let ((.cse105 (select (select (store (store .cse108 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse107 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse106 (select (select (store .cse107 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse105) (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (= .cse106 1) (= .cse105 1) (= .cse106 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse113 (store .cse112 v_arrayElimCell_17 v_prenex_21)) (.cse111 (store v_prenex_19 8 2))) (let ((.cse109 (select (select (store .cse113 v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse110 (select (select (store (store .cse112 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse113 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse109 1) (= .cse109 0) (= .cse110 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse110 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse116 (store .cse115 v_arrayElimCell_16 v_ArrVal_338)) (.cse118 (store v_ArrVal_337 8 2))) (let ((.cse114 (select (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse117 (select (select (store (store (store .cse115 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse114 0) (= .cse114 1) (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse117 0) (= .cse117 1)))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse122 (store .cse121 v_arrayElimCell_17 v_prenex_21))) (let ((.cse119 (select (select (store .cse122 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse120 (select (select (store (store .cse121 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse122 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse119 1) (= .cse119 0) (= .cse120 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse120 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_31 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse124 (store .cse128 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse125 (store .cse124 v_arrayElimCell_17 v_prenex_32)) (.cse127 (store v_prenex_30 8 2))) (let ((.cse123 (select (select (store (store .cse128 v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse126 (select (select (store .cse125 v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse123 1) (= (select (select (store (store .cse124 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse125 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse123 0) (= .cse126 1) (= .cse126 0))))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse129 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse129 1) (= .cse129 0)))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse130 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse130 0) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse130 1)))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse134 (store .cse133 v_arrayElimCell_17 v_ArrVal_338)) (.cse132 (store v_ArrVal_337 8 2))) (let ((.cse131 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse131 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse133 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse136 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse137 (store .cse136 v_arrayElimCell_16 v_ArrVal_338)) (.cse139 (store v_ArrVal_337 8 2))) (let ((.cse135 (select (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse138 (select (select (store (store (store .cse136 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse135 0) (= .cse135 1) (= (select (select (store (store .cse136 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse138 0) (= .cse138 1)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse143 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse144 (store .cse143 v_arrayElimCell_17 v_prenex_21)) (.cse145 (store v_prenex_19 8 2))) (let ((.cse140 (select (select (store .cse144 v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse142 (select (select (store (store .cse143 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse144 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse140 1) (= .cse140 0) (= .cse141 0) (= .cse142 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse141 1) (= .cse142 0) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse146 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse146 1) (= .cse146 0))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse147 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse147 0) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)) (= .cse147 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse148 (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse148 0) (not (= (select .cse0 v_arrayElimCell_17) 0)) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (= .cse148 1) (not (= (select v_arrayElimArr_9 12) 2)) (= (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse152 (store .cse151 v_arrayElimCell_16 v_prenex_29))) (let ((.cse150 (select (select (store .cse152 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse150 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (= .cse150 1) (= (select (select (store (store .cse151 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse152 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store .cse152 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse153 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_arrayElimCell_17) 0)) (= .cse153 0) (= .cse153 1) (not (= (select v_arrayElimArr_10 12) 2)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_prenex_24))) (let ((.cse154 (select (select (store .cse157 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse157 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 0) (= .cse154 1) (= .cse155 0) (= .cse155 1) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse160 (select (select (store (store .cse159 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse158 (select (select (store (store (store .cse159 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse158 1) (= .cse158 0)))) (= .cse160 0) (= .cse160 1))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse162 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse161 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 0) (= .cse161 1) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse166 (store .cse167 v_arrayElimCell_17 v_prenex_24))) (let ((.cse164 (select (select (store (store .cse167 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse166 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse165 (select (select (store .cse166 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse164 1) (= .cse165 0) (= .cse164 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse165 1)))))) .cse12) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse0 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse168 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse168 1) (= .cse168 0)))))) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse169 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse169 1) (= .cse169 0)))) (not (= 0 (select .cse0 v_prenex_25)))))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse172 (store .cse171 v_arrayElimCell_17 v_prenex_29))) (let ((.cse170 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse170 1) (= .cse170 0) (= (select (select (store (store .cse171 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse172 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse176 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse177 (store .cse176 v_arrayElimCell_17 v_prenex_24)) (.cse174 (store v_prenex_22 8 2))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse175 (select (select (store .cse177 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store .cse173 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse175 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse173 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse176 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse177 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse175 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse183 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse182 (store v_prenex_19 8 2)) (.cse181 (store .cse183 v_arrayElimCell_16 v_prenex_21))) (let ((.cse178 (select (select (store (store .cse183 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse181 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse180 (select (select (store (store (store .cse183 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store .cse181 v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse178) (= .cse179 1) (= .cse180 0) (= .cse178 1) (= .cse180 1) (= .cse179 0)))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse187 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332)) (.cse185 (store v_prenex_27 8 2))) (let ((.cse186 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (store .cse187 v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse184 v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 0) (= (select (select (store (store .cse187 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse184 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 1) (= 0 (select (select (store .cse184 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0)))))) .cse12))) is different from true [2025-02-05 14:35:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:16,354 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2025-02-05 14:35:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 14:35:16,357 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 14:35:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:16,357 INFO L225 Difference]: With dead ends: 81 [2025-02-05 14:35:16,358 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 14:35:16,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=84, Invalid=197, Unknown=3, NotChecked=96, Total=380 [2025-02-05 14:35:16,359 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:16,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 218 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 85 Unchecked, 0.7s Time] [2025-02-05 14:35:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 14:35:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2025-02-05 14:35:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-02-05 14:35:16,370 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 18 [2025-02-05 14:35:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:16,370 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-02-05 14:35:16,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-02-05 14:35:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 14:35:16,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:16,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:16,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:35:16,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:16,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash -914310984, now seen corresponding path program 1 times [2025-02-05 14:35:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:35:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012322236] [2025-02-05 14:35:16,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:35:16,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 14:35:16,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 14:35:16,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:16,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:35:16,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012322236] [2025-02-05 14:35:16,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012322236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:35:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354398596] [2025-02-05 14:35:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:16,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:35:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:35:16,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:35:16,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:35:16,809 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:17,032 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-02-05 14:35:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:17,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 14:35:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:17,034 INFO L225 Difference]: With dead ends: 79 [2025-02-05 14:35:17,034 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 14:35:17,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:35:17,035 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:17,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:35:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 14:35:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-05 14:35:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2025-02-05 14:35:17,048 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 19 [2025-02-05 14:35:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:17,049 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2025-02-05 14:35:17,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2025-02-05 14:35:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:35:17,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:17,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:17,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:35:17,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:17,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1867837049, now seen corresponding path program 1 times [2025-02-05 14:35:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:35:17,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153028276] [2025-02-05 14:35:17,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:35:17,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:35:17,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:35:17,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:17,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:35:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153028276] [2025-02-05 14:35:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153028276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:35:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998648304] [2025-02-05 14:35:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:35:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:35:17,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:35:17,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:35:17,117 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:17,224 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-05 14:35:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:17,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 14:35:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:17,226 INFO L225 Difference]: With dead ends: 53 [2025-02-05 14:35:17,226 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 14:35:17,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:35:17,227 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:17,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:35:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 14:35:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-05 14:35:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-02-05 14:35:17,239 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2025-02-05 14:35:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:17,240 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-02-05 14:35:17,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-02-05 14:35:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:35:17,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:17,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 14:35:17,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1907414652, now seen corresponding path program 1 times [2025-02-05 14:35:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:35:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655597581] [2025-02-05 14:35:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:35:17,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:35:17,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:35:17,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:17,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:35:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655597581] [2025-02-05 14:35:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655597581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:35:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685133089] [2025-02-05 14:35:18,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:18,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:18,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:35:18,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:35:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:35:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:18,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-05 14:35:18,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:18,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:35:18,179 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:35:18,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:35:18,208 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:35:18,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-05 14:35:18,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-05 14:35:18,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-05 14:35:18,230 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:35:18,246 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:35:18,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2025-02-05 14:35:18,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 18 [2025-02-05 14:35:18,286 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:35:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:35:18,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:18,422 INFO L349 Elim1Store]: treesize reduction 255, result has 0.4 percent of original size [2025-02-05 14:35:18,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 486 treesize of output 450 [2025-02-05 14:35:18,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:18,574 INFO L349 Elim1Store]: treesize reduction 139, result has 17.8 percent of original size [2025-02-05 14:35:18,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 469 treesize of output 463 [2025-02-05 14:35:18,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 305 [2025-02-05 14:35:19,046 INFO L349 Elim1Store]: treesize reduction 344, result has 19.1 percent of original size [2025-02-05 14:35:19,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 1248 treesize of output 1217 [2025-02-05 14:35:19,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:19,257 INFO L349 Elim1Store]: treesize reduction 329, result has 25.4 percent of original size [2025-02-05 14:35:19,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 468 [2025-02-05 14:35:19,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 874 treesize of output 688 [2025-02-05 14:35:19,345 INFO L349 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2025-02-05 14:35:19,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 224 [2025-02-05 14:35:19,442 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-02-05 14:35:19,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2025-02-05 14:35:19,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:19,555 INFO L349 Elim1Store]: treesize reduction 84, result has 19.2 percent of original size [2025-02-05 14:35:19,556 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 4 case distinctions, treesize of input 381 treesize of output 323 [2025-02-05 14:35:19,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 26 treesize of output 29 [2025-02-05 14:35:19,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 42 [2025-02-05 14:35:19,858 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-02-05 14:35:19,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 132 [2025-02-05 14:35:19,913 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2025-02-05 14:35:19,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 46 [2025-02-05 14:35:19,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 38 treesize of output 41 [2025-02-05 14:35:19,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 77 treesize of output 76 [2025-02-05 14:35:20,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 61 treesize of output 60 [2025-02-05 14:35:20,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 30 treesize of output 33 [2025-02-05 14:35:20,086 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-05 14:35:20,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:35:20,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:20,288 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-05 14:35:20,295 INFO L158 Benchmark]: Toolchain (without parser) took 30495.96ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 122.6MB in the beginning and 453.0MB in the end (delta: -330.4MB). Peak memory consumption was 307.3MB. Max. memory is 16.1GB. [2025-02-05 14:35:20,295 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:35:20,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.24ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 104.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:35:20,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.43ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 103.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:35:20,295 INFO L158 Benchmark]: Boogie Preprocessor took 40.22ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 101.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:35:20,296 INFO L158 Benchmark]: IcfgBuilder took 325.61ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 85.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:35:20,296 INFO L158 Benchmark]: TraceAbstraction took 29702.31ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 85.0MB in the beginning and 453.0MB in the end (delta: -368.1MB). Peak memory consumption was 265.4MB. Max. memory is 16.1GB. [2025-02-05 14:35:20,299 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.24ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 104.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.43ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 103.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.22ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 101.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 325.61ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 85.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29702.31ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 85.0MB in the beginning and 453.0MB in the end (delta: -368.1MB). Peak memory consumption was 265.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-02-05 14:35:20,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:35:22,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:35:22,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 14:35:22,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:35:22,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:35:22,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:35:22,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:35:22,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:35:22,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:35:22,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:35:22,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:35:22,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:35:22,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:35:22,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:35:22,727 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:35:22,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:35:22,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:35:22,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:35:22,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:35:22,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:35:22,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:35:22,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:35:22,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:35:22,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:35:22,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:35:22,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:35:22,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:35:22,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:35:22,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-02-05 14:35:23,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:35:23,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:35:23,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:35:23,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:35:23,039 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:35:23,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-05 14:35:24,393 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2585dd6a8/a0018a2e9ae14f03abe89a79fc7e5063/FLAGba6511acc [2025-02-05 14:35:24,678 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:35:24,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-05 14:35:24,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2585dd6a8/a0018a2e9ae14f03abe89a79fc7e5063/FLAGba6511acc [2025-02-05 14:35:24,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2585dd6a8/a0018a2e9ae14f03abe89a79fc7e5063 [2025-02-05 14:35:24,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:35:24,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:35:24,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:35:24,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:35:24,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:35:24,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:35:24" (1/1) ... [2025-02-05 14:35:24,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68844f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:24, skipping insertion in model container [2025-02-05 14:35:24,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:35:24" (1/1) ... [2025-02-05 14:35:25,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:35:25,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-05 14:35:25,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-05 14:35:25,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-05 14:35:25,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-05 14:35:25,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-05 14:35:25,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-05 14:35:25,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:35:25,257 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:35:25,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-05 14:35:25,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-05 14:35:25,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-05 14:35:25,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-05 14:35:25,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-05 14:35:25,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-05 14:35:25,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:35:25,347 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:35:25,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25 WrapperNode [2025-02-05 14:35:25,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:35:25,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:35:25,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:35:25,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:35:25,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,396 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-02-05 14:35:25,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:35:25,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:35:25,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:35:25,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:35:25,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,437 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-05 14:35:25,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:35:25,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:35:25,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:35:25,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:35:25,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (1/1) ... [2025-02-05 14:35:25,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:35:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:25,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:35:25,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:35:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 14:35:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 14:35:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:35:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:35:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:35:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:35:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:35:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:35:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:35:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-05 14:35:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-05 14:35:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 14:35:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 14:35:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:35:25,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:35:25,618 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:35:25,619 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:35:26,142 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 14:35:26,142 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:35:26,149 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:35:26,150 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:35:26,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:35:26 BoogieIcfgContainer [2025-02-05 14:35:26,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:35:26,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:35:26,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:35:26,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:35:26,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:35:24" (1/3) ... [2025-02-05 14:35:26,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c730a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:35:26, skipping insertion in model container [2025-02-05 14:35:26,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:35:25" (2/3) ... [2025-02-05 14:35:26,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c730a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:35:26, skipping insertion in model container [2025-02-05 14:35:26,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:35:26" (3/3) ... [2025-02-05 14:35:26,159 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-02-05 14:35:26,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:35:26,174 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 1 procedures, 46 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-02-05 14:35:26,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:35:26,230 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;@6b3a07b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:35:26,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-05 14:35:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 45 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:35:26,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:26,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:26,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:26,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -977920417, now seen corresponding path program 1 times [2025-02-05 14:35:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111029249] [2025-02-05 14:35:26,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:26,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:26,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:26,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:26,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:35:26,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:35:26,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:35:26,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:26,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:26,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 14:35:26,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:26,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-05 14:35:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-05 14:35:26,543 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 48 treesize of output 28 [2025-02-05 14:35:26,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2025-02-05 14:35:26,582 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-05 14:35:26,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-05 14:35:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:26,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:35:26,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111029249] [2025-02-05 14:35:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111029249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:35:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464686149] [2025-02-05 14:35:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:26,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:35:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:26,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:35:26,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:35:26,635 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 45 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:27,520 INFO L93 Difference]: Finished difference Result 88 states and 134 transitions. [2025-02-05 14:35:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:35:27,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-05 14:35:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:27,527 INFO L225 Difference]: With dead ends: 88 [2025-02-05 14:35:27,527 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 14:35:27,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:35:27,531 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:27,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 14:35:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 14:35:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-05 14:35:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-02-05 14:35:27,557 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 7 [2025-02-05 14:35:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:27,558 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-02-05 14:35:27,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-02-05 14:35:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:35:27,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:27,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:27,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:35:27,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:27,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -251900837, now seen corresponding path program 1 times [2025-02-05 14:35:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:27,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514379510] [2025-02-05 14:35:27,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:27,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:27,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:27,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:27,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:35:27,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:35:27,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:35:27,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:27,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:27,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:35:27,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:27,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:35:27,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514379510] [2025-02-05 14:35:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514379510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:27,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:35:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855749795] [2025-02-05 14:35:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:35:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:35:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:35:27,887 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:28,312 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2025-02-05 14:35:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:35:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:28,313 INFO L225 Difference]: With dead ends: 59 [2025-02-05 14:35:28,313 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 14:35:28,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:35:28,314 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:28,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:35:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 14:35:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2025-02-05 14:35:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-02-05 14:35:28,321 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 8 [2025-02-05 14:35:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:28,321 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-02-05 14:35:28,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-02-05 14:35:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 14:35:28,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:28,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:28,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:35:28,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:28,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -868902221, now seen corresponding path program 1 times [2025-02-05 14:35:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81489921] [2025-02-05 14:35:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:28,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:28,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:35:28,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 14:35:28,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 14:35:28,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:28,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:28,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 14:35:28,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:28,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-05 14:35:28,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:28,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2025-02-05 14:35:28,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:28,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:35:28,838 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-05 14:35:28,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-05 14:35:28,848 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:35:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:28,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:35:28,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81489921] [2025-02-05 14:35:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81489921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:35:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405255027] [2025-02-05 14:35:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:28,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:35:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:28,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:35:28,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:35:28,900 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:30,434 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-02-05 14:35:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 14:35:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:30,435 INFO L225 Difference]: With dead ends: 77 [2025-02-05 14:35:30,435 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 14:35:30,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:35:30,436 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:30,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 109 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 14:35:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 14:35:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-02-05 14:35:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-02-05 14:35:30,443 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 13 [2025-02-05 14:35:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:30,444 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-02-05 14:35:30,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-02-05 14:35:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 14:35:30,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:30,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:30,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:35:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:30,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:30,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash -868881367, now seen corresponding path program 1 times [2025-02-05 14:35:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832712283] [2025-02-05 14:35:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:30,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:30,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:30,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:35:30,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 14:35:30,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 14:35:30,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:30,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:30,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:35:30,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:30,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:35:30,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832712283] [2025-02-05 14:35:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832712283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:30,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:35:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722366668] [2025-02-05 14:35:30,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:35:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:30,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:35:30,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:35:30,788 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:31,129 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2025-02-05 14:35:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:31,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 14:35:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:31,130 INFO L225 Difference]: With dead ends: 45 [2025-02-05 14:35:31,130 INFO L226 Difference]: Without dead ends: 43 [2025-02-05 14:35:31,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:35:31,132 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:31,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 100 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:35:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-05 14:35:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-05 14:35:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-02-05 14:35:31,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2025-02-05 14:35:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:31,141 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-02-05 14:35:31,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-02-05 14:35:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:35:31,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:31,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:31,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:35:31,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:31,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1421441085, now seen corresponding path program 1 times [2025-02-05 14:35:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939445837] [2025-02-05 14:35:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:31,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:31,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:31,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:35:31,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:35:31,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:35:31,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:31,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:31,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 14:35:31,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:31,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-05 14:35:31,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:31,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:31,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2025-02-05 14:35:31,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2025-02-05 14:35:31,576 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:35:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 65 [2025-02-05 14:35:31,617 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-05 14:35:31,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 83 [2025-02-05 14:35:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-05 14:35:31,642 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 23 treesize of output 15 [2025-02-05 14:35:31,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 13 [2025-02-05 14:35:31,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:35:31,678 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-05 14:35:31,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-05 14:35:31,844 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 27 treesize of output 15 [2025-02-05 14:35:31,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:35:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:31,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:35:31,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939445837] [2025-02-05 14:35:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939445837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:35:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327512051] [2025-02-05 14:35:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:35:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:31,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:35:31,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:35:31,882 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:33,718 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-05 14:35:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:35:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 14:35:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:33,719 INFO L225 Difference]: With dead ends: 53 [2025-02-05 14:35:33,719 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 14:35:33,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:35:33,722 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:33,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 14:35:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 14:35:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-05 14:35:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2025-02-05 14:35:33,735 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 17 [2025-02-05 14:35:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:33,735 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2025-02-05 14:35:33,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2025-02-05 14:35:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:35:33,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:33,736 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:33,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 14:35:33,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:33,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -349152393, now seen corresponding path program 1 times [2025-02-05 14:35:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352709351] [2025-02-05 14:35:33,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:33,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:33,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:33,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:33,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:35:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:35:34,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:35:34,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:34,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:34,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 14:35:34,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:34,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-05 14:35:34,073 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 11 treesize of output 7 [2025-02-05 14:35:34,164 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-05 14:35:34,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-02-05 14:35:34,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-05 14:35:34,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:34,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:35:34,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-02-05 14:35:34,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:35:34,208 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:35:34,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:34,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:34,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-05 14:35:34,389 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-05 14:35:34,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 14:35:34,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:34,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:34,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:34,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:35:34,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:34,810 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 100 [2025-02-05 14:35:34,817 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 196 treesize of output 148 [2025-02-05 14:35:34,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 112 treesize of output 106 [2025-02-05 14:35:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:39,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352709351] [2025-02-05 14:35:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352709351] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:35:39,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:35:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-02-05 14:35:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015099707] [2025-02-05 14:35:39,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:35:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 14:35:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 14:35:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=48, Unknown=3, NotChecked=0, Total=72 [2025-02-05 14:35:39,546 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:44,048 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-02-05 14:35:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 14:35:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:44,049 INFO L225 Difference]: With dead ends: 61 [2025-02-05 14:35:44,049 INFO L226 Difference]: Without dead ends: 59 [2025-02-05 14:35:44,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=35, Invalid=72, Unknown=3, NotChecked=0, Total=110 [2025-02-05 14:35:44,050 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:44,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 159 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-05 14:35:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-05 14:35:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-02-05 14:35:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-02-05 14:35:44,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 18 [2025-02-05 14:35:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-02-05 14:35:44,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-02-05 14:35:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 14:35:44,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:44,061 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:44,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 14:35:44,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:44,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1504396935, now seen corresponding path program 1 times [2025-02-05 14:35:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623100201] [2025-02-05 14:35:44,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:44,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:44,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:44,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:35:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:35:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:35:44,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:44,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:44,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 14:35:44,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:44,395 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 11 treesize of output 7 [2025-02-05 14:35:44,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-05 14:35:44,472 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:35:44,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-02-05 14:35:44,500 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:35:44,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:35:44,537 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-05 14:35:44,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-02-05 14:35:44,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-05 14:35:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:44,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:35:44,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2025-02-05 14:35:44,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2025-02-05 14:35:44,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2025-02-05 14:35:44,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:44,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-05 14:35:44,779 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-05 14:35:44,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 14:35:44,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2025-02-05 14:35:44,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 60 [2025-02-05 14:35:44,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2025-02-05 14:35:44,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 58 [2025-02-05 14:35:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:44,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:35:44,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:44,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-02-05 14:35:44,915 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 74 treesize of output 54 [2025-02-05 14:35:44,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 45 [2025-02-05 14:35:45,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:45,158 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 115 [2025-02-05 14:35:45,166 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 237 treesize of output 177 [2025-02-05 14:35:45,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 136 treesize of output 128 [2025-02-05 14:35:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:45,788 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623100201] [2025-02-05 14:35:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623100201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:35:45,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:35:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 14:35:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655682467] [2025-02-05 14:35:45,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:35:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:35:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:45,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:35:45,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=63, Unknown=3, NotChecked=0, Total=90 [2025-02-05 14:35:45,789 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:50,592 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2025-02-05 14:35:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 14:35:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:50,594 INFO L225 Difference]: With dead ends: 71 [2025-02-05 14:35:50,594 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 14:35:50,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=90, Unknown=3, NotChecked=0, Total=132 [2025-02-05 14:35:50,595 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:50,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 161 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 14:35:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 14:35:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-02-05 14:35:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2025-02-05 14:35:50,601 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 22 [2025-02-05 14:35:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:50,601 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2025-02-05 14:35:50,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2025-02-05 14:35:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:35:50,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:50,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:50,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 14:35:50,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:50,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:50,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1867837049, now seen corresponding path program 1 times [2025-02-05 14:35:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865499472] [2025-02-05 14:35:50,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:50,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:50,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:50,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:50,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 14:35:50,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:35:50,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:35:50,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:50,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:50,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:35:50,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:50,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:35:50,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:35:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865499472] [2025-02-05 14:35:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865499472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:35:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370823428] [2025-02-05 14:35:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:50,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:35:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:35:50,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:35:50,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:35:50,948 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:51,245 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-05 14:35:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:35:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 14:35:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:51,246 INFO L225 Difference]: With dead ends: 53 [2025-02-05 14:35:51,246 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 14:35:51,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:35:51,247 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:51,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:35:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 14:35:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-05 14:35:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-02-05 14:35:51,251 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2025-02-05 14:35:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:51,251 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-02-05 14:35:51,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:35:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-02-05 14:35:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:35:51,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:51,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:51,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 14:35:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:51,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1907414652, now seen corresponding path program 1 times [2025-02-05 14:35:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:35:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014013513] [2025-02-05 14:35:51,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:51,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:51,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:35:51,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 14:35:51,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:35:51,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:35:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:51,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 14:35:51,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:51,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-05 14:35:51,624 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:35:51,650 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:35:51,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-05 14:35:51,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-05 14:35:51,707 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-05 14:35:51,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-02-05 14:35:51,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:35:51,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:51,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:35:51,753 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:35:51,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:51,956 INFO L349 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2025-02-05 14:35:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 275 treesize of output 253 [2025-02-05 14:35:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:52,176 INFO L349 Elim1Store]: treesize reduction 103, result has 17.6 percent of original size [2025-02-05 14:35:52,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 234 treesize of output 238 [2025-02-05 14:35:52,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:52,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:52,284 INFO L349 Elim1Store]: treesize reduction 62, result has 16.2 percent of original size [2025-02-05 14:35:52,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 155 [2025-02-05 14:35:52,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 93 [2025-02-05 14:35:52,392 INFO L349 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2025-02-05 14:35:52,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2025-02-05 14:35:52,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-05 14:35:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 115 treesize of output 99 [2025-02-05 14:35:52,459 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-02-05 14:35:52,460 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 3 case distinctions, treesize of input 62 treesize of output 12 [2025-02-05 14:35:52,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2025-02-05 14:35:52,497 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-02-05 14:35:52,498 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 3 case distinctions, treesize of input 70 treesize of output 20 [2025-02-05 14:35:52,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-02-05 14:35:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:52,545 INFO L349 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2025-02-05 14:35:52,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 278 treesize of output 258 [2025-02-05 14:35:52,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:35:52,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2025-02-05 14:35:52,902 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 15 treesize of output 7 [2025-02-05 14:35:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:52,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:35:53,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,062 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-02-05 14:35:53,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 81 [2025-02-05 14:35:53,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 900 treesize of output 836 [2025-02-05 14:35:53,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 400 [2025-02-05 14:35:53,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 149 treesize of output 118 [2025-02-05 14:35:53,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 179 treesize of output 117 [2025-02-05 14:35:53,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2025-02-05 14:35:53,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2025-02-05 14:35:53,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,878 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 458 [2025-02-05 14:35:53,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,898 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 338 [2025-02-05 14:35:53,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:53,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65482 treesize of output 50933 [2025-02-05 14:35:54,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:54,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21166 treesize of output 18065 [2025-02-05 14:35:54,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:54,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3457 treesize of output 3142 [2025-02-05 14:35:54,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:54,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3133 treesize of output 2834 [2025-02-05 14:35:54,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:54,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2825 treesize of output 2834 [2025-02-05 14:35:55,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:55,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2809 treesize of output 2794 [2025-02-05 14:35:55,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2785 treesize of output 2749 [2025-02-05 14:35:55,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:55,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2749 treesize of output 2722 [2025-02-05 14:35:55,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2713 treesize of output 2701 [2025-02-05 14:35:55,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:55,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2701 treesize of output 2666 [2025-02-05 14:35:55,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2641 treesize of output 2593 [2025-02-05 14:35:55,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:55,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2593 treesize of output 2550 [2025-02-05 14:35:55,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:55,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2525 treesize of output 2270 [2025-02-05 14:35:55,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2245 treesize of output 2197 [2025-02-05 14:35:55,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:55,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2197 treesize of output 2166