./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB --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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:33:36,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:33:36,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:33:36,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:33:36,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:33:37,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:33:37,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:33:37,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:33:37,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:33:37,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:33:37,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:33:37,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:33:37,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:33:37,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:33:37,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:33:37,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:33:37,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:33:37,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:33:37,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:33:37,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:33:37,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:33:37,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:33:37,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:33:37,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:33:37,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:33:37,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:33:37,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:33:37,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:33:37,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:37,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:33:37,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:37,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:33:37,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:33:37,057 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2024-11-28 03:33:37,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:33:37,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:33:37,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:33:37,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:33:37,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:33:37,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2024-11-28 03:33:40,552 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/24d25959a/cea5080139894b5bb90f27c23c1a3ade/FLAG617e79e27 [2024-11-28 03:33:40,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:33:40,942 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/sv-benchmarks/c/list-properties/simple_built_from_end.i [2024-11-28 03:33:40,957 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/24d25959a/cea5080139894b5bb90f27c23c1a3ade/FLAG617e79e27 [2024-11-28 03:33:40,976 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/24d25959a/cea5080139894b5bb90f27c23c1a3ade [2024-11-28 03:33:40,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:33:40,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:33:40,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:33:40,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:33:40,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:33:40,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:33:40" (1/1) ... [2024-11-28 03:33:40,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7432ffc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:40, skipping insertion in model container [2024-11-28 03:33:40,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:33:40" (1/1) ... [2024-11-28 03:33:41,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:33:41,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2024-11-28 03:33:41,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:33:41,416 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:33:41,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2024-11-28 03:33:41,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:33:41,487 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:33:41,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41 WrapperNode [2024-11-28 03:33:41,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:33:41,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:33:41,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:33:41,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:33:41,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,528 INFO L138 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-28 03:33:41,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:33:41,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:33:41,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:33:41,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:33:41,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,555 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-28 03:33:41,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:33:41,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:33:41,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:33:41,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:33:41,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (1/1) ... [2024-11-28 03:33:41,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:41,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:33:41,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:33:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:33:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:33:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:33:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:33:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:33:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:33:41,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:33:41,751 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:33:41,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:33:41,862 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-28 03:33:41,862 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:33:41,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:33:41,877 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:33:41,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:41 BoogieIcfgContainer [2024-11-28 03:33:41,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:33:41,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:33:41,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:33:41,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:33:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:33:40" (1/3) ... [2024-11-28 03:33:41,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc6b2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:33:41, skipping insertion in model container [2024-11-28 03:33:41,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:41" (2/3) ... [2024-11-28 03:33:41,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc6b2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:33:41, skipping insertion in model container [2024-11-28 03:33:41,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:41" (3/3) ... [2024-11-28 03:33:41,893 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2024-11-28 03:33:41,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:33:41,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.i that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 03:33:42,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:33:42,018 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;@1f594146, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:33:42,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:33:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) [2024-11-28 03:33:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 03:33:42,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:42,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:42,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:42,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1822206426, now seen corresponding path program 1 times [2024-11-28 03:33:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894213018] [2024-11-28 03:33:42,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:42,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894213018] [2024-11-28 03:33:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894213018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:42,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:42,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038891200] [2024-11-28 03:33:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:33:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:42,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:33:42,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:33:42,255 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-28 03:33:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:42,265 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-28 03:33:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:33:42,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2024-11-28 03:33:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:42,273 INFO L225 Difference]: With dead ends: 26 [2024-11-28 03:33:42,274 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:33:42,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:33:42,284 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:42,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:33:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 03:33:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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) [2024-11-28 03:33:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-28 03:33:42,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2024-11-28 03:33:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:42,316 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-28 03:33:42,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-28 03:33:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-28 03:33:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:33:42,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:42,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:42,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:33:42,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:42,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash 150383342, now seen corresponding path program 1 times [2024-11-28 03:33:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243240069] [2024-11-28 03:33:42,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243240069] [2024-11-28 03:33:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243240069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:42,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:42,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214851959] [2024-11-28 03:33:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:42,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:42,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:42,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:42,458 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2024-11-28 03:33:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:42,491 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-28 03:33:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 [2024-11-28 03:33:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:42,495 INFO L225 Difference]: With dead ends: 25 [2024-11-28 03:33:42,495 INFO L226 Difference]: Without dead ends: 18 [2024-11-28 03:33:42,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:42,496 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:42,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-28 03:33:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-11-28 03:33:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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) [2024-11-28 03:33:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-28 03:33:42,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 8 [2024-11-28 03:33:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:42,502 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-28 03:33:42,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2024-11-28 03:33:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-28 03:33:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:33:42,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:42,503 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:42,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:33:42,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:42,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1540695980, now seen corresponding path program 1 times [2024-11-28 03:33:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:42,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465255035] [2024-11-28 03:33:42,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465255035] [2024-11-28 03:33:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465255035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:33:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135156443] [2024-11-28 03:33:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:42,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:33:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:42,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:33:42,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:33:42,813 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-11-28 03:33:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:42,864 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-28 03:33:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:33:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2024-11-28 03:33:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:42,865 INFO L225 Difference]: With dead ends: 24 [2024-11-28 03:33:42,865 INFO L226 Difference]: Without dead ends: 22 [2024-11-28 03:33:42,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:33:42,866 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:42,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:33:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-28 03:33:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-11-28 03:33:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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) [2024-11-28 03:33:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-28 03:33:42,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-11-28 03:33:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:42,871 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 03:33:42,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-11-28 03:33:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-28 03:33:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:33:42,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:42,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:42,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:33:42,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:42,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1887104538, now seen corresponding path program 1 times [2024-11-28 03:33:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973462869] [2024-11-28 03:33:42,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:43,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:43,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973462869] [2024-11-28 03:33:43,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973462869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:43,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001948593] [2024-11-28 03:33:43,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:43,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:43,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:43,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:43,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:33:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:43,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:33:43,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:43,554 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 [2024-11-28 03:33:43,567 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 [2024-11-28 03:33:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:43,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001948593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:33:43,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:33:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 6 [2024-11-28 03:33:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256438296] [2024-11-28 03:33:43,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:33:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:33:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:43,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:33:43,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:33:43,906 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-28 03:33:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:43,976 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-28 03:33:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:33:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 [2024-11-28 03:33:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:43,977 INFO L225 Difference]: With dead ends: 37 [2024-11-28 03:33:43,977 INFO L226 Difference]: Without dead ends: 26 [2024-11-28 03:33:43,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:33:43,978 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:43,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:33:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-28 03:33:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-28 03:33:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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) [2024-11-28 03:33:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-28 03:33:43,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2024-11-28 03:33:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:43,988 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-28 03:33:43,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-28 03:33:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-28 03:33:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:33:43,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:43,990 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:44,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:33:44,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:44,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:44,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1844212596, now seen corresponding path program 2 times [2024-11-28 03:33:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487139381] [2024-11-28 03:33:44,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:33:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:44,229 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:33:44,230 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487139381] [2024-11-28 03:33:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487139381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791272698] [2024-11-28 03:33:45,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:33:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:45,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:45,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:33:45,170 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:33:45,170 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:45,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 03:33:45,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:45,189 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 [2024-11-28 03:33:45,227 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 22 treesize of output 7 [2024-11-28 03:33:45,302 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:33:45,302 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 11 treesize of output 11 [2024-11-28 03:33:45,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:33:45,394 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 15 treesize of output 1 [2024-11-28 03:33:45,401 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 24 treesize of output 19 [2024-11-28 03:33:45,524 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 31 treesize of output 19 [2024-11-28 03:33:45,530 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 19 treesize of output 11 [2024-11-28 03:33:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:45,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:45,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:45,834 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 23 treesize of output 29 [2024-11-28 03:33:45,846 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 [2024-11-28 03:33:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791272698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:33:45,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:33:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-28 03:33:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310621767] [2024-11-28 03:33:45,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:33:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:33:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:45,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:33:45,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=217, Unknown=6, NotChecked=0, Total=272 [2024-11-28 03:33:45,887 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) [2024-11-28 03:33:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:46,205 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-28 03:33:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:33:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) Word has length 22 [2024-11-28 03:33:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:46,206 INFO L225 Difference]: With dead ends: 33 [2024-11-28 03:33:46,206 INFO L226 Difference]: Without dead ends: 31 [2024-11-28 03:33:46,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=348, Unknown=6, NotChecked=0, Total=462 [2024-11-28 03:33:46,208 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:46,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:33:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-28 03:33:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-28 03:33:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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) [2024-11-28 03:33:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-28 03:33:46,214 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2024-11-28 03:33:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:46,214 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-28 03:33:46,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) [2024-11-28 03:33:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-28 03:33:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:33:46,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:46,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-28 03:33:46,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:33:46,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:46,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -71698118, now seen corresponding path program 3 times [2024-11-28 03:33:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562614661] [2024-11-28 03:33:46,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:33:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:46,468 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 03:33:46,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:47,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:47,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562614661] [2024-11-28 03:33:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562614661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:47,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832430836] [2024-11-28 03:33:47,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:33:47,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:47,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:47,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:47,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:33:47,519 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 03:33:47,520 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:47,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 03:33:47,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:47,566 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 [2024-11-28 03:33:47,602 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 [2024-11-28 03:33:47,610 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 [2024-11-28 03:33:47,668 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:33:47,669 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 11 treesize of output 11 [2024-11-28 03:33:47,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:33:47,742 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 21 treesize of output 23 [2024-11-28 03:33:47,751 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 [2024-11-28 03:33:47,771 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 20 treesize of output 15 [2024-11-28 03:33:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:48,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:48,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:48,214 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 17 treesize of output 21 [2024-11-28 03:33:48,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:48,229 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 17 treesize of output 21 [2024-11-28 03:33:48,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:48,518 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 22 treesize of output 23 [2024-11-28 03:33:48,525 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 36 treesize of output 24 [2024-11-28 03:33:48,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:48,538 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 18 treesize of output 20 [2024-11-28 03:33:48,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:48,596 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 22 treesize of output 23 [2024-11-28 03:33:48,604 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 36 treesize of output 24 [2024-11-28 03:33:48,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:48,618 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 18 treesize of output 20 [2024-11-28 03:33:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832430836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:33:48,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:33:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-28 03:33:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179698093] [2024-11-28 03:33:48,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:33:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:33:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:48,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:33:48,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=165, Unknown=4, NotChecked=0, Total=210 [2024-11-28 03:33:48,883 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 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) [2024-11-28 03:33:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:49,111 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-11-28 03:33:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:33:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 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) Word has length 26 [2024-11-28 03:33:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:49,113 INFO L225 Difference]: With dead ends: 50 [2024-11-28 03:33:49,113 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 03:33:49,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=187, Unknown=4, NotChecked=0, Total=240 [2024-11-28 03:33:49,115 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:49,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:33:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 03:33:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-28 03:33:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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) [2024-11-28 03:33:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-28 03:33:49,121 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2024-11-28 03:33:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-28 03:33:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 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) [2024-11-28 03:33:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-28 03:33:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:33:49,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:49,122 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-28 03:33:49,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:33:49,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-28 03:33:49,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:49,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1761617632, now seen corresponding path program 4 times [2024-11-28 03:33:49,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:49,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181497935] [2024-11-28 03:33:49,327 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:33:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:49,394 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:33:49,395 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:50,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181497935] [2024-11-28 03:33:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181497935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917557084] [2024-11-28 03:33:50,691 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:33:50,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:50,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:50,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:50,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:33:50,809 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:33:50,809 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:50,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 03:33:50,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:50,852 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 18 treesize of output 7 [2024-11-28 03:33:50,882 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 [2024-11-28 03:33:50,957 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 03:33:50,957 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 20 treesize of output 23 [2024-11-28 03:33:50,972 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 [2024-11-28 03:33:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:33:51,081 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:33:51,081 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 11 treesize of output 11 [2024-11-28 03:33:51,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:33:51,192 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 21 treesize of output 23 [2024-11-28 03:33:51,196 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 [2024-11-28 03:33:51,213 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 40 treesize of output 29 [2024-11-28 03:33:51,235 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 03:33:51,236 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 40 treesize of output 47 [2024-11-28 03:33:52,274 INFO L349 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2024-11-28 03:33:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 135 [2024-11-28 03:33:52,379 INFO L349 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2024-11-28 03:33:52,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 113 [2024-11-28 03:33:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:53,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:54,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:54,393 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 38 treesize of output 42 [2024-11-28 03:33:54,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:54,402 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 33 treesize of output 37 [2024-11-28 03:33:54,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:54,758 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 55 treesize of output 56 [2024-11-28 03:33:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:33:54,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2024-11-28 03:33:54,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:54,796 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 51 treesize of output 53 [2024-11-28 03:33:54,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:54,809 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 78 treesize of output 68 [2024-11-28 03:33:54,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:33:54,821 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 98 [2024-11-28 03:33:54,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:54,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2024-11-28 03:33:55,080 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-11-28 03:33:55,080 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 18 treesize of output 18 [2024-11-28 03:33:55,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:33:55,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-28 03:33:55,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_24| Int) (|v_ULTIMATE.start_main_~t~0#1.base_23| Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_248) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_255))) (or (not (= (select (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24|) 0) 1)) (= (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= (select v_ArrVal_255 0) 1)) (= |v_ULTIMATE.start_main_~t~0#1.base_24| |v_ULTIMATE.start_main_~t~0#1.base_23|)))) is different from false [2024-11-28 03:33:55,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:55,823 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 54 treesize of output 46 [2024-11-28 03:33:55,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:33:55,831 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 66 treesize of output 58 [2024-11-28 03:33:55,843 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:33:55,844 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 46 treesize of output 43 [2024-11-28 03:33:55,850 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 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-28 03:33:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-28 03:33:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917557084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:33:55,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:33:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35 [2024-11-28 03:33:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959082070] [2024-11-28 03:33:55,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:33:55,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 03:33:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:55,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 03:33:55,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=987, Unknown=2, NotChecked=64, Total=1190 [2024-11-28 03:33:55,860 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 states have internal predecessors, (79), 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) [2024-11-28 03:33:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:57,154 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-28 03:33:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:33:57,156 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 states have internal predecessors, (79), 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 31 [2024-11-28 03:33:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:57,157 INFO L225 Difference]: With dead ends: 42 [2024-11-28 03:33:57,157 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 03:33:57,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=285, Invalid=1439, Unknown=2, NotChecked=80, Total=1806 [2024-11-28 03:33:57,159 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:57,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 151 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 24 Unchecked, 0.4s Time] [2024-11-28 03:33:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 03:33:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-28 03:33:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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) [2024-11-28 03:33:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-28 03:33:57,170 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 31 [2024-11-28 03:33:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:57,171 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-28 03:33:57,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 states have internal predecessors, (79), 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) [2024-11-28 03:33:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-28 03:33:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:33:57,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:57,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-11-28 03:33:57,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:33:57,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 03:33:57,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:57,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash -66410266, now seen corresponding path program 5 times [2024-11-28 03:33:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833894214] [2024-11-28 03:33:57,373 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:33:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:57,426 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 03:33:57,426 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833894214] [2024-11-28 03:33:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833894214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:58,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328822951] [2024-11-28 03:33:58,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:33:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:58,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:58,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:33:58,811 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 03:33:58,811 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:58,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-28 03:33:58,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:58,835 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 [2024-11-28 03:33:58,859 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 [2024-11-28 03:33:58,867 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 [2024-11-28 03:33:58,917 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:33:58,917 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 [2024-11-28 03:33:58,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:33:58,976 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 20 treesize of output 15 [2024-11-28 03:33:58,986 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 21 treesize of output 23 [2024-11-28 03:33:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-28 03:33:59,109 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-28 03:33:59,110 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 20 treesize of output 22 [2024-11-28 03:33:59,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:33:59,224 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:33:59,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 50 [2024-11-28 03:33:59,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 03:33:59,245 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 [2024-11-28 03:33:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:59,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:59,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:59,959 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 45 treesize of output 49 [2024-11-28 03:33:59,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:59,966 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 40 treesize of output 39 [2024-11-28 03:33:59,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:59,982 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 45 treesize of output 44 [2024-11-28 03:33:59,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:59,990 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 35 treesize of output 39 [2024-11-28 03:34:00,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,371 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 54 treesize of output 53 [2024-11-28 03:34:00,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,380 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 44 treesize of output 48 [2024-11-28 03:34:00,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2024-11-28 03:34:00,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,418 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 44 treesize of output 48 [2024-11-28 03:34:00,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,919 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 75 treesize of output 76 [2024-11-28 03:34:00,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,932 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 65 treesize of output 56 [2024-11-28 03:34:00,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:34:00,939 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 44 treesize of output 38 [2024-11-28 03:34:00,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:34:00,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:00,949 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 178 [2024-11-28 03:34:00,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,967 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 86 treesize of output 76 [2024-11-28 03:34:00,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:00,982 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 81 treesize of output 67 [2024-11-28 03:34:00,990 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 27 treesize of output 21 [2024-11-28 03:34:01,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,205 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 75 treesize of output 66 [2024-11-28 03:34:01,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,217 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 55 treesize of output 56 [2024-11-28 03:34:01,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:01,266 INFO L349 Elim1Store]: treesize reduction 47, result has 24.2 percent of original size [2024-11-28 03:34:01,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 364 treesize of output 328 [2024-11-28 03:34:01,288 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 262 treesize of output 256 [2024-11-28 03:34:01,303 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 82 treesize of output 68 [2024-11-28 03:34:01,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,319 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 70 treesize of output 66 [2024-11-28 03:34:01,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:01,334 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-28 03:34:01,343 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 59 treesize of output 51 [2024-11-28 03:34:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328822951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:02,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-28 03:34:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328818534] [2024-11-28 03:34:02,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 03:34:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:02,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 03:34:02,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=419, Unknown=15, NotChecked=0, Total=506 [2024-11-28 03:34:02,076 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 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) [2024-11-28 03:34:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:02,634 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-28 03:34:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:34:02,635 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 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 35 [2024-11-28 03:34:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:02,636 INFO L225 Difference]: With dead ends: 63 [2024-11-28 03:34:02,636 INFO L226 Difference]: Without dead ends: 44 [2024-11-28 03:34:02,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=455, Unknown=15, NotChecked=0, Total=552 [2024-11-28 03:34:02,637 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:02,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 200 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:34:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-28 03:34:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-28 03:34:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 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) [2024-11-28 03:34:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-28 03:34:02,645 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2024-11-28 03:34:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:02,645 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-28 03:34:02,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 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) [2024-11-28 03:34:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-28 03:34:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 03:34:02,646 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:02,646 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2024-11-28 03:34:02,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:34:02,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:02,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1309979712, now seen corresponding path program 6 times [2024-11-28 03:34:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980837886] [2024-11-28 03:34:02,847 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:34:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:02,885 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 03:34:02,885 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:34:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980837886] [2024-11-28 03:34:05,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980837886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:05,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791835974] [2024-11-28 03:34:05,036 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:34:05,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:05,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:05,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:05,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:34:05,219 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 03:34:05,220 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:34:05,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 03:34:05,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:05,233 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 [2024-11-28 03:34:05,248 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 18 treesize of output 7 [2024-11-28 03:34:05,295 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:34:05,295 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 [2024-11-28 03:34:05,384 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 15 treesize of output 1 [2024-11-28 03:34:05,390 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 [2024-11-28 03:34:05,400 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 20 treesize of output 15 [2024-11-28 03:34:05,541 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-28 03:34:05,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-28 03:34:05,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:34:05,693 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 65 treesize of output 42 [2024-11-28 03:34:05,704 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-28 03:34:05,718 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 21 treesize of output 23 [2024-11-28 03:34:05,727 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 [2024-11-28 03:34:05,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:05,902 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-28 03:34:05,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-28 03:34:06,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:34:06,073 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:34:06,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 68 [2024-11-28 03:34:06,080 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 28 treesize of output 23 [2024-11-28 03:34:06,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:06,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 03:34:06,097 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 [2024-11-28 03:34:07,067 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 03:34:07,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 62 [2024-11-28 03:34:07,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:34:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:07,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:07,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:07,521 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 94 treesize of output 88 [2024-11-28 03:34:07,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:07,530 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 79 treesize of output 73 [2024-11-28 03:34:07,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:07,869 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 115 treesize of output 109 [2024-11-28 03:34:07,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:07,881 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 100 treesize of output 94 [2024-11-28 03:34:08,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_37| Int) (v_arrayElimArr_31 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_29 4))) (let ((.cse0 (store (store |c_#memory_int#1| .cse1 v_ArrVal_470) |v_ULTIMATE.start_main_~t~0#1.base_37| v_ArrVal_478))) (or (not (= (select (select .cse0 .cse1) 0) 1)) (not (= (select v_arrayElimArr_31 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_30 4) 0)) (not (= (select |c_#valid| .cse1) 0)) (not (= (select v_arrayElimArr_32 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_arrayElimArr_32) |v_ULTIMATE.start_main_~t~0#1.base_37| v_arrayElimArr_30)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_31) |v_ULTIMATE.start_main_~t~0#1.base_37| v_arrayElimArr_29))) (let ((.cse3 (select (select .cse2 .cse1) 4)) (.cse4 (+ (select (select .cse5 .cse1) 4) 4))) (select (select .cse0 (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_37|) 0)))))) is different from false [2024-11-28 03:34:08,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,271 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 162 treesize of output 143 [2024-11-28 03:34:08,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,286 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 132 treesize of output 113 [2024-11-28 03:34:08,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:08,337 INFO L349 Elim1Store]: treesize reduction 45, result has 27.4 percent of original size [2024-11-28 03:34:08,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1516 treesize of output 1438 [2024-11-28 03:34:08,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:08,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3434 treesize of output 3308 [2024-11-28 03:34:08,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,447 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 192 treesize of output 166 [2024-11-28 03:34:08,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,468 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 136 treesize of output 126 [2024-11-28 03:34:08,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,490 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-28 03:34:08,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:08,520 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 61 treesize of output 59 [2024-11-28 03:34:19,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:19,772 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 60 treesize of output 52 [2024-11-28 03:34:19,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:34:19,778 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:34:19,780 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 126 treesize of output 118 [2024-11-28 03:34:19,794 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 54 treesize of output 52 [2024-11-28 03:34:19,801 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 98 treesize of output 90 [2024-11-28 03:34:19,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:19,816 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 96 treesize of output 98 [2024-11-28 03:34:19,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:19,981 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 89 treesize of output 68 [2024-11-28 03:34:19,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:34:19,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:34:19,990 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 999 treesize of output 963 [2024-11-28 03:34:20,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:20,009 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 51 treesize of output 55 [2024-11-28 03:34:20,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:20,027 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 50 treesize of output 52 [2024-11-28 03:34:20,042 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 54 treesize of output 46 [2024-11-28 03:34:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 36 refuted. 4 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-28 03:34:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791835974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:24,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2024-11-28 03:34:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668576323] [2024-11-28 03:34:24,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-28 03:34:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:24,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-28 03:34:24,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1459, Unknown=7, NotChecked=78, Total=1722 [2024-11-28 03:34:24,146 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 42 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 42 states have internal predecessors, (103), 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) [2024-11-28 03:34:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:39,447 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-11-28 03:34:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:34:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 42 states have internal predecessors, (103), 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 40 [2024-11-28 03:34:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:39,451 INFO L225 Difference]: With dead ends: 51 [2024-11-28 03:34:39,451 INFO L226 Difference]: Without dead ends: 49 [2024-11-28 03:34:39,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=439, Invalid=2311, Unknown=10, NotChecked=102, Total=2862 [2024-11-28 03:34:39,460 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:39,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 242 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 428 Invalid, 0 Unknown, 35 Unchecked, 1.6s Time] [2024-11-28 03:34:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-28 03:34:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-28 03:34:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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) [2024-11-28 03:34:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-28 03:34:39,477 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2024-11-28 03:34:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:39,477 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-28 03:34:39,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 42 states have internal predecessors, (103), 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) [2024-11-28 03:34:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-28 03:34:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 03:34:39,483 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:39,484 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-28 03:34:39,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:34:39,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:39,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:39,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -121910394, now seen corresponding path program 7 times [2024-11-28 03:34:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:39,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177265016] [2024-11-28 03:34:39,686 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:34:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177265016] [2024-11-28 03:34:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177265016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923517743] [2024-11-28 03:34:42,252 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:34:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:42,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:42,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:34:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:42,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-28 03:34:42,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:42,447 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 [2024-11-28 03:34:42,477 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 [2024-11-28 03:34:42,484 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 [2024-11-28 03:34:42,550 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:34:42,551 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 [2024-11-28 03:34:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:34:42,626 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 20 treesize of output 15 [2024-11-28 03:34:42,634 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 21 treesize of output 23 [2024-11-28 03:34:42,644 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 [2024-11-28 03:34:42,809 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-28 03:34:42,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-28 03:34:42,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 14 [2024-11-28 03:34:43,005 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 11 treesize of output 14 [2024-11-28 03:34:43,036 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-28 03:34:43,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 61 [2024-11-28 03:34:43,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-28 03:34:43,299 INFO L349 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2024-11-28 03:34:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2024-11-28 03:34:43,482 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 9 treesize of output 12 [2024-11-28 03:34:43,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:34:43,521 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2024-11-28 03:34:43,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 123 [2024-11-28 03:34:43,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2024-11-28 03:34:52,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-28 03:34:52,707 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 03:34:52,708 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 03:34:52,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:34:52,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:34:52,912 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-28 03:34:52,918 INFO L158 Benchmark]: Toolchain (without parser) took 71937.36ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 93.7MB in the beginning and 456.2MB in the end (delta: -362.5MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2024-11-28 03:34:52,918 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:52,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.91ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 76.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:34:52,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.02ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 75.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:52,919 INFO L158 Benchmark]: Boogie Preprocessor took 39.35ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:52,919 INFO L158 Benchmark]: RCFGBuilder took 311.10ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 62.4MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:34:52,919 INFO L158 Benchmark]: TraceAbstraction took 71034.49ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 61.9MB in the beginning and 456.2MB in the end (delta: -394.3MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-11-28 03:34:52,921 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.39ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.91ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 76.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.02ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 75.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.35ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 73.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 311.10ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 62.4MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 71034.49ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 61.9MB in the beginning and 456.2MB in the end (delta: -394.3MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB --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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:34:55,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:34:55,601 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:34:55,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:34:55,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:34:55,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:34:55,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:34:55,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:34:55,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:34:55,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:34:55,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:34:55,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:34:55,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:34:55,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:34:55,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:34:55,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:34:55,681 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:34:55,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:55,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:55,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:34:55,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:55,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:55,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:55,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:55,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:34:55,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:34:55,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:34:55,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:34:55,685 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:34:55,685 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:34:55,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:34:55,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:34:55,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:34:55,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:34:55,686 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2024-11-28 03:34:56,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:34:56,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:34:56,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:34:56,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:34:56,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:34:56,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2024-11-28 03:34:59,020 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/663498a60/1d5eb1f32c8c46aeb272e64c087d117e/FLAG8174eab42 [2024-11-28 03:34:59,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:34:59,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/sv-benchmarks/c/list-properties/simple_built_from_end.i [2024-11-28 03:34:59,373 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/663498a60/1d5eb1f32c8c46aeb272e64c087d117e/FLAG8174eab42 [2024-11-28 03:34:59,397 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/data/663498a60/1d5eb1f32c8c46aeb272e64c087d117e [2024-11-28 03:34:59,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:34:59,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:34:59,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:59,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:34:59,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:34:59,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a16dfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59, skipping insertion in model container [2024-11-28 03:34:59,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:34:59,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2024-11-28 03:34:59,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:59,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:34:59,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2024-11-28 03:34:59,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:59,885 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:34:59,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59 WrapperNode [2024-11-28 03:34:59,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:59,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:59,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:34:59,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:34:59,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,937 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-28 03:34:59,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:59,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:34:59,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:34:59,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:34:59,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,978 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-28 03:34:59,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:34:59,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:35:00,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:35:00,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:35:00,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:35:00,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:35:00,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:35:00,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:35:00,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:35:00,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (1/1) ... [2024-11-28 03:35:00,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:35:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:00,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:35:00,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:35:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 03:35:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 03:35:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 03:35:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 03:35:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:35:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 03:35:00,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:35:00,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:35:00,246 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:35:00,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:35:00,433 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-28 03:35:00,433 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:35:00,446 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:35:00,447 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:35:00,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:35:00 BoogieIcfgContainer [2024-11-28 03:35:00,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:35:00,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:35:00,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:35:00,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:35:00,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:34:59" (1/3) ... [2024-11-28 03:35:00,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b28eb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:35:00, skipping insertion in model container [2024-11-28 03:35:00,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:59" (2/3) ... [2024-11-28 03:35:00,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b28eb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:35:00, skipping insertion in model container [2024-11-28 03:35:00,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:35:00" (3/3) ... [2024-11-28 03:35:00,462 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2024-11-28 03:35:00,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:35:00,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.i that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 03:35:00,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:35:00,564 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;@1ec28c22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:35:00,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:35:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) [2024-11-28 03:35:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 03:35:00,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:00,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:00,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:00,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1822206426, now seen corresponding path program 1 times [2024-11-28 03:35:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325145710] [2024-11-28 03:35:00,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:00,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:00,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:00,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:35:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:00,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:35:00,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:00,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:35:00,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325145710] [2024-11-28 03:35:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325145710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227163250] [2024-11-28 03:35:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:00,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:35:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:00,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:35:00,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:35:00,804 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-28 03:35:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:00,835 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-28 03:35:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:35:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2024-11-28 03:35:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:00,845 INFO L225 Difference]: With dead ends: 26 [2024-11-28 03:35:00,845 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:35:00,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:35:00,852 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:00,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:35:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:35:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 03:35:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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) [2024-11-28 03:35:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-28 03:35:00,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2024-11-28 03:35:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:00,885 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-28 03:35:00,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-28 03:35:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-28 03:35:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:35:00,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:00,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:00,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:35:01,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:01,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 150383342, now seen corresponding path program 1 times [2024-11-28 03:35:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129691687] [2024-11-28 03:35:01,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:01,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:01,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:01,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:01,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:35:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:01,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:35:01,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:01,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:35:01,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129691687] [2024-11-28 03:35:01,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129691687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:01,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:35:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774639043] [2024-11-28 03:35:01,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:01,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:01,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:01,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:01,286 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2024-11-28 03:35:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:01,341 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-28 03:35:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 [2024-11-28 03:35:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:01,342 INFO L225 Difference]: With dead ends: 25 [2024-11-28 03:35:01,343 INFO L226 Difference]: Without dead ends: 18 [2024-11-28 03:35:01,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:01,344 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:01,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:35:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-28 03:35:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-11-28 03:35:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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) [2024-11-28 03:35:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-28 03:35:01,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 8 [2024-11-28 03:35:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:01,355 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-28 03:35:01,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2024-11-28 03:35:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-28 03:35:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:35:01,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:01,358 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:01,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:35:01,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:01,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:01,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1540695980, now seen corresponding path program 1 times [2024-11-28 03:35:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8491070] [2024-11-28 03:35:01,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:01,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:01,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:01,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:35:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:01,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:35:01,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:01,728 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 22 treesize of output 7 [2024-11-28 03:35:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:01,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:35:01,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8491070] [2024-11-28 03:35:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8491070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:35:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089632529] [2024-11-28 03:35:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:35:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:01,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:35:01,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:35:01,784 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-11-28 03:35:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:01,890 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-28 03:35:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:35:01,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2024-11-28 03:35:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:01,892 INFO L225 Difference]: With dead ends: 24 [2024-11-28 03:35:01,893 INFO L226 Difference]: Without dead ends: 22 [2024-11-28 03:35:01,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:35:01,894 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:01,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:35:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-28 03:35:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-11-28 03:35:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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) [2024-11-28 03:35:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-28 03:35:01,904 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-11-28 03:35:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:01,905 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 03:35:01,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-11-28 03:35:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-28 03:35:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:35:01,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:01,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:01,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:35:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:02,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1887104538, now seen corresponding path program 1 times [2024-11-28 03:35:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186165764] [2024-11-28 03:35:02,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:02,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:02,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:02,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:35:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:02,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 03:35:02,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:02,392 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 [2024-11-28 03:35:02,404 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 [2024-11-28 03:35:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:02,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:02,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186165764] [2024-11-28 03:35:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186165764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:35:02,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:35:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2024-11-28 03:35:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965201220] [2024-11-28 03:35:02,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:35:02,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:35:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:02,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:35:02,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:02,822 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-28 03:35:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:02,990 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-28 03:35:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:35:02,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 [2024-11-28 03:35:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:02,992 INFO L225 Difference]: With dead ends: 37 [2024-11-28 03:35:02,992 INFO L226 Difference]: Without dead ends: 26 [2024-11-28 03:35:02,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:02,993 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:02,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:35:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-28 03:35:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-28 03:35:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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) [2024-11-28 03:35:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-28 03:35:03,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2024-11-28 03:35:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:03,000 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-28 03:35:03,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-28 03:35:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-28 03:35:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:35:03,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:03,001 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:03,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:35:03,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:03,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:03,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1844212596, now seen corresponding path program 2 times [2024-11-28 03:35:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953244857] [2024-11-28 03:35:03,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:35:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:03,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:03,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:03,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:35:03,311 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:35:03,311 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:35:03,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:35:03,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:03,327 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 [2024-11-28 03:35:03,359 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 22 treesize of output 7 [2024-11-28 03:35:03,448 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:35:03,449 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 [2024-11-28 03:35:03,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:35:03,540 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 15 treesize of output 1 [2024-11-28 03:35:03,549 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 24 treesize of output 19 [2024-11-28 03:35:03,705 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 31 treesize of output 19 [2024-11-28 03:35:03,718 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 19 treesize of output 11 [2024-11-28 03:35:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:03,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:03,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_59 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_59) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2024-11-28 03:35:08,115 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 38 treesize of output 36 [2024-11-28 03:35:08,135 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 9 treesize of output 7 [2024-11-28 03:35:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 03:35:08,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:08,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953244857] [2024-11-28 03:35:08,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953244857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:35:08,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:35:08,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-28 03:35:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054837776] [2024-11-28 03:35:08,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:35:08,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:35:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:08,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:35:08,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=68, Unknown=3, NotChecked=16, Total=110 [2024-11-28 03:35:08,182 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) [2024-11-28 03:35:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:08,833 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-28 03:35:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:35:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) Word has length 22 [2024-11-28 03:35:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:08,835 INFO L225 Difference]: With dead ends: 33 [2024-11-28 03:35:08,837 INFO L226 Difference]: Without dead ends: 31 [2024-11-28 03:35:08,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=62, Invalid=149, Unknown=3, NotChecked=26, Total=240 [2024-11-28 03:35:08,838 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:08,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 22 Unchecked, 0.4s Time] [2024-11-28 03:35:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-28 03:35:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-28 03:35:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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) [2024-11-28 03:35:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-28 03:35:08,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2024-11-28 03:35:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:08,854 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-28 03:35:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) [2024-11-28 03:35:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-28 03:35:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:35:08,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:08,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-28 03:35:08,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:35:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:09,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash -71698118, now seen corresponding path program 3 times [2024-11-28 03:35:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863147374] [2024-11-28 03:35:09,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:35:09,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:09,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:09,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:09,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:35:09,190 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 03:35:09,191 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:35:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 03:35:09,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:09,287 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 [2024-11-28 03:35:09,374 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 [2024-11-28 03:35:09,389 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 [2024-11-28 03:35:09,519 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:35:09,520 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 [2024-11-28 03:35:09,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:35:09,677 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 20 treesize of output 15 [2024-11-28 03:35:09,694 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 21 treesize of output 23 [2024-11-28 03:35:09,702 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 [2024-11-28 03:35:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:10,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:10,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:10,499 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 17 treesize of output 21 [2024-11-28 03:35:10,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:10,523 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 17 treesize of output 21 [2024-11-28 03:35:16,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:16,200 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 22 treesize of output 23 [2024-11-28 03:35:16,238 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 36 treesize of output 24 [2024-11-28 03:35:16,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:16,379 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 18 treesize of output 20 [2024-11-28 03:35:16,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:16,833 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 22 treesize of output 23 [2024-11-28 03:35:16,910 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 36 treesize of output 24 [2024-11-28 03:35:17,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:17,078 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 18 treesize of output 20 [2024-11-28 03:35:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:19,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863147374] [2024-11-28 03:35:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863147374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:35:19,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:35:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-28 03:35:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156817672] [2024-11-28 03:35:19,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:35:19,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:35:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:19,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:35:19,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=119, Unknown=6, NotChecked=0, Total=156 [2024-11-28 03:35:19,151 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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) [2024-11-28 03:35:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:20,968 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-11-28 03:35:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:35:20,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 26 [2024-11-28 03:35:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:20,971 INFO L225 Difference]: With dead ends: 50 [2024-11-28 03:35:20,971 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 03:35:20,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=38, Invalid=138, Unknown=6, NotChecked=0, Total=182 [2024-11-28 03:35:20,972 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:20,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 03:35:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 03:35:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-28 03:35:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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) [2024-11-28 03:35:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-28 03:35:20,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2024-11-28 03:35:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-28 03:35:20,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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) [2024-11-28 03:35:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-28 03:35:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:35:20,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:20,982 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-28 03:35:20,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:35:21,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:21,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:21,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1761617632, now seen corresponding path program 4 times [2024-11-28 03:35:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:21,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409374837] [2024-11-28 03:35:21,185 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:35:21,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:21,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:21,190 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:21,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:35:21,289 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:35:21,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:35:21,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 03:35:21,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:21,329 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 [2024-11-28 03:35:21,479 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 22 treesize of output 7 [2024-11-28 03:35:22,099 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:35:22,100 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 [2024-11-28 03:35:22,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:35:22,637 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 24 treesize of output 19 [2024-11-28 03:35:22,698 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 15 treesize of output 1 [2024-11-28 03:35:23,605 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 03:35:23,605 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 24 treesize of output 26 [2024-11-28 03:35:24,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:35:24,380 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 60 treesize of output 43 [2024-11-28 03:35:24,439 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-28 03:35:24,473 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 33 treesize of output 35 [2024-11-28 03:35:24,556 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 [2024-11-28 03:35:26,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:35:26,895 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 74 treesize of output 37 [2024-11-28 03:35:26,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-28 03:35:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:27,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:28,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:28,288 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 38 treesize of output 42 [2024-11-28 03:35:28,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:28,346 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 33 treesize of output 37 [2024-11-28 03:35:28,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_8 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_7 .cse0))) (= (_ bv1 32) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_150) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:35:28,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (select v_arrayElimArr_8 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_7 (_ bv4 32)))) (= (_ bv1 32) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_150) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_7) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_8) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:35:29,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:29,079 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 55 treesize of output 56 [2024-11-28 03:35:29,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:35:29,148 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2024-11-28 03:35:29,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:29,206 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 84 treesize of output 74 [2024-11-28 03:35:29,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:35:29,271 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 110 [2024-11-28 03:35:29,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:29,385 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-28 03:35:29,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:29,520 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 28 treesize of output 30 [2024-11-28 03:35:30,448 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 [2024-11-28 03:35:38,105 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 169 treesize of output 167 [2024-11-28 03:35:38,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:38,269 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 150 treesize of output 155 [2024-11-28 03:35:38,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:35:38,422 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 146 treesize of output 149 [2024-11-28 03:35:38,489 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 120 treesize of output 116 [2024-11-28 03:35:38,520 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 116 treesize of output 114 [2024-11-28 03:35:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 03:35:45,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409374837] [2024-11-28 03:35:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409374837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:35:45,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:35:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2024-11-28 03:35:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330033477] [2024-11-28 03:35:45,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:35:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:35:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:45,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:35:45,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=6, NotChecked=58, Total=306 [2024-11-28 03:35:45,107 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 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) [2024-11-28 03:35:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:53,824 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-28 03:35:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:35:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 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 31 [2024-11-28 03:35:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:53,825 INFO L225 Difference]: With dead ends: 42 [2024-11-28 03:35:53,825 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 03:35:53,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=129, Invalid=425, Unknown=6, NotChecked=90, Total=650 [2024-11-28 03:35:53,827 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:53,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 108 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 60 Unchecked, 5.2s Time] [2024-11-28 03:35:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 03:35:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-28 03:35:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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) [2024-11-28 03:35:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-28 03:35:53,843 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 31 [2024-11-28 03:35:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:53,843 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-28 03:35:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 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) [2024-11-28 03:35:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-28 03:35:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:35:53,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:53,844 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-11-28 03:35:53,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:35:54,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:54,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:54,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash -66410266, now seen corresponding path program 5 times [2024-11-28 03:35:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:54,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139152501] [2024-11-28 03:35:54,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:35:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:54,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:54,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:35:54,647 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 03:35:54,647 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:35:54,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 03:35:54,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:54,921 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 [2024-11-28 03:35:55,322 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 [2024-11-28 03:35:55,399 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 [2024-11-28 03:35:56,056 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:35:56,057 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 [2024-11-28 03:35:56,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:35:56,885 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 20 treesize of output 15 [2024-11-28 03:35:56,944 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 21 treesize of output 23 [2024-11-28 03:35:56,981 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 [2024-11-28 03:35:58,295 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 03:35:58,296 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 24 treesize of output 26 [2024-11-28 03:35:59,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:35:59,288 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:35:59,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 50 [2024-11-28 03:35:59,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 03:35:59,489 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 [2024-11-28 03:36:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:36:04,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:36:06,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:06,332 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 45 treesize of output 44 [2024-11-28 03:36:06,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:06,405 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 35 treesize of output 39 [2024-11-28 03:36:06,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:06,567 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 45 treesize of output 49 [2024-11-28 03:36:06,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:06,628 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 40 treesize of output 39 [2024-11-28 03:36:13,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:13,953 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 54 treesize of output 53 [2024-11-28 03:36:14,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:14,021 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 44 treesize of output 48 [2024-11-28 03:36:14,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:14,267 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 54 treesize of output 53 [2024-11-28 03:36:14,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:14,333 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 44 treesize of output 48 [2024-11-28 03:36:14,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_13 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_17 .cse0))) (= (_ bv0 32) (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_13))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_18) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_14) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_16))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_15) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (bvadd (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32))))) (not (= (select v_arrayElimArr_15 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (select v_arrayElimArr_19 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_16 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_20 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))))) is different from false [2024-11-28 03:36:17,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:17,116 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 75 treesize of output 76 [2024-11-28 03:36:17,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:17,178 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 65 treesize of output 56 [2024-11-28 03:36:17,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:36:17,219 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 44 treesize of output 38 [2024-11-28 03:36:17,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:36:17,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:17,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 178 [2024-11-28 03:36:17,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:17,434 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 99 treesize of output 85 [2024-11-28 03:36:17,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:17,579 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 66 treesize of output 56 [2024-11-28 03:36:17,614 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 27 treesize of output 21 [2024-11-28 03:36:19,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:19,770 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 75 treesize of output 66 [2024-11-28 03:36:19,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:19,848 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 55 treesize of output 56 [2024-11-28 03:36:20,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:20,384 INFO L349 Elim1Store]: treesize reduction 45, result has 27.4 percent of original size [2024-11-28 03:36:20,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 364 treesize of output 330 [2024-11-28 03:36:20,449 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 262 treesize of output 256 [2024-11-28 03:36:20,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:20,597 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 82 treesize of output 78 [2024-11-28 03:36:20,631 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 70 treesize of output 56 [2024-11-28 03:36:20,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 65 treesize of output 57 [2024-11-28 03:36:20,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:20,795 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2024-11-28 03:36:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 29 refuted. 3 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 03:36:35,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:36:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139152501] [2024-11-28 03:36:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139152501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:36:35,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:36:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-11-28 03:36:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863184752] [2024-11-28 03:36:35,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:36:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:36:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:36:35,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:36:35,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=247, Unknown=14, NotChecked=32, Total=342 [2024-11-28 03:36:35,325 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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) [2024-11-28 03:36:40,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_14 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_13 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_17 .cse0))) (= (_ bv0 32) (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_13))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_18) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_14) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_16))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_15) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (bvadd (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32))))) (not (= (select v_arrayElimArr_15 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (select v_arrayElimArr_19 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_16 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_20 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))))) is different from false [2024-11-28 03:36:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:36:45,354 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-28 03:36:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:36:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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 35 [2024-11-28 03:36:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:36:45,356 INFO L225 Difference]: With dead ends: 63 [2024-11-28 03:36:45,356 INFO L226 Difference]: Without dead ends: 44 [2024-11-28 03:36:45,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=58, Invalid=277, Unknown=15, NotChecked=70, Total=420 [2024-11-28 03:36:45,357 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:36:45,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 70 Unchecked, 5.3s Time] [2024-11-28 03:36:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-28 03:36:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-28 03:36:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 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) [2024-11-28 03:36:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-28 03:36:45,364 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2024-11-28 03:36:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:36:45,365 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-28 03:36:45,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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) [2024-11-28 03:36:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-28 03:36:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 03:36:45,366 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:36:45,366 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2024-11-28 03:36:45,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:36:45,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:36:45,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:36:45,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1309979712, now seen corresponding path program 6 times [2024-11-28 03:36:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:36:45,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786158828] [2024-11-28 03:36:45,567 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:36:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:36:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:36:45,569 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:36:45,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:36:46,398 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 03:36:46,399 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:36:46,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 03:36:46,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:46,436 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 [2024-11-28 03:36:46,594 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 22 treesize of output 7 [2024-11-28 03:36:47,194 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:36:47,195 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 [2024-11-28 03:36:47,662 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 15 treesize of output 1 [2024-11-28 03:36:47,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:36:47,802 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 24 treesize of output 19 [2024-11-28 03:36:48,968 INFO L349 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2024-11-28 03:36:48,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2024-11-28 03:36:49,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:36:49,920 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 75 treesize of output 52 [2024-11-28 03:36:50,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-28 03:36:50,072 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 33 treesize of output 35 [2024-11-28 03:36:50,102 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 [2024-11-28 03:36:51,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:51,943 INFO L349 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2024-11-28 03:36:51,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2024-11-28 03:36:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:36:53,180 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:36:53,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 65 [2024-11-28 03:36:53,311 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 40 treesize of output 35 [2024-11-28 03:36:53,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:53,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:53,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-28 03:36:53,412 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 [2024-11-28 03:36:58,920 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 03:36:58,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 59 [2024-11-28 03:36:58,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 03:36:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:36:59,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:37:01,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:01,229 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 94 treesize of output 88 [2024-11-28 03:37:01,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:01,287 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 79 treesize of output 73 [2024-11-28 03:37:01,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_28 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv1 32) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2024-11-28 03:37:01,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= (select v_arrayElimArr_28 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv1 32) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2024-11-28 03:37:02,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:02,043 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 131 treesize of output 125 [2024-11-28 03:37:02,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:02,110 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 116 treesize of output 110 [2024-11-28 03:37:02,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse2 (select v_arrayElimArr_27 (_ bv4 32))) (.cse0 (select v_arrayElimArr_28 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= .cse0 |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_30 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= .cse2 |c_ULTIMATE.start_main_~t~0#1.base|)) (= (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27)) (.cse7 (bvadd (_ bv4 32) .cse0))) (let ((.cse4 (select (select .cse3 .cse2) .cse7)) (.cse5 (bvadd (select (select .cse6 .cse2) .cse7) (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))) (_ bv1 32)) (not (= (select v_arrayElimArr_29 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))) is different from false [2024-11-28 03:37:02,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse0 (select v_arrayElimArr_27 (_ bv4 32)))) (or (= (_ bv1 32) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27))) (let ((.cse2 (select (select .cse1 .cse0) (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse0) (_ bv4 32))))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse0))) (not (= (_ bv0 1) (select (store |c_#valid| .cse0 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_30 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_29 (_ bv4 32))))))) is different from false [2024-11-28 03:37:03,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:03,485 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 162 treesize of output 143 [2024-11-28 03:37:03,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:03,550 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 132 treesize of output 113 [2024-11-28 03:37:03,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:37:03,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:37:03,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:37:03,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 756 treesize of output 706 [2024-11-28 03:37:03,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:37:03,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:37:03,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1460 treesize of output 1374 [2024-11-28 03:37:03,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:03,936 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 177 treesize of output 155 [2024-11-28 03:37:04,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:04,091 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 71 treesize of output 67 [2024-11-28 03:37:04,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:04,237 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 124 treesize of output 114 [2024-11-28 03:37:04,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:04,358 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 90 [2024-11-28 03:37:37,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)))) (let ((.cse6 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) (_ bv0 32))))))) (.cse9 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse50 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse50 v_arrayElimCell_104) (_ bv0 32))))))))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))))) (.cse2 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse20 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))) (.cse10 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) v_arrayElimCell_102))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (.cse11 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse49 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse26 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse48 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse31 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) v_arrayElimCell_106)))))) (.cse7 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|))))) (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse0 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (or .cse2 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse3 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse3 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse5 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)))))))) .cse6) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse8 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse8 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102))))))) .cse6) .cse7) .cse9 .cse10 .cse11 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse12 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse12 v_arrayElimCell_104) (_ bv0 32)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse13 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse14 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse14 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and .cse6 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_100) (_ bv0 32))))))))) .cse7) (or (and .cse6 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse7) (or (and .cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse18 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse18 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse19 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse19 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse20) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse21 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse21 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and .cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse23 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse23 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse23 v_arrayElimCell_100) (_ bv0 32))))))))) .cse7) .cse9 (or (and .cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse24 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_104) (_ bv0 32)))))))))) .cse26 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse27 v_arrayElimCell_100) v_arrayElimCell_102)) (= (select (select .cse27 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse7 (and .cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_104) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse29 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse29 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse31 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse32 v_arrayElimCell_100) (_ bv0 32))) (= (select (select .cse32 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse20)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) (_ bv0 32)))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) v_arrayElimCell_102))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse36 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse36 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) .cse2) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse10 (or (and .cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse38 (_ bv0 32))) (= (_ bv1 32) (select .cse38 v_arrayElimCell_102)))))))) .cse7) .cse11) .cse2) (or .cse2 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse39 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse40 (_ bv0 32))) (= (_ bv1 32) (select .cse40 v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse20) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse41 v_arrayElimCell_106)) (= (_ bv1 32) (select .cse41 v_arrayElimCell_102))))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse20) .cse7) (or (and .cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse42 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse42 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse43 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse43 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse10 .cse11 .cse26 .cse31 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse44 v_arrayElimCell_104) v_arrayElimCell_106))))))) .cse17) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse45 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse46 v_arrayElimCell_99) v_arrayElimCell_102)) (= (select (select .cse46 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))))))) is different from false [2024-11-28 03:37:41,996 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)))) (let ((.cse6 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) (_ bv0 32))))))) (.cse9 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse50 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse50 v_arrayElimCell_104) (_ bv0 32))))))))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))))) (.cse2 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse20 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))) (.cse10 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) v_arrayElimCell_102))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (.cse11 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse49 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse26 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse48 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse31 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) v_arrayElimCell_106)))))) (.cse7 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|))))) (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse0 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (or .cse2 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse3 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse3 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse5 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)))))))) .cse6) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse8 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse8 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102))))))) .cse6) .cse7) .cse9 .cse10 .cse11 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse12 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse12 v_arrayElimCell_104) (_ bv0 32)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse13 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse14 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse14 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and .cse6 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_100) (_ bv0 32))))))))) .cse7) (or (and .cse6 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse7) (or (and .cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse18 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse18 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse19 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse19 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse20) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse21 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse21 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and .cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse23 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse23 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse23 v_arrayElimCell_100) (_ bv0 32))))))))) .cse7) .cse9 (or (and .cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse24 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_104) (_ bv0 32)))))))))) .cse26 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse27 v_arrayElimCell_100) v_arrayElimCell_102)) (= (select (select .cse27 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse7 (and .cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_104) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse29 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse29 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse31 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse32 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse32 v_arrayElimCell_100) (_ bv0 32))) (= (select (select .cse32 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse20)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) (_ bv0 32)))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) v_arrayElimCell_102))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse36 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse36 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) .cse2) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse10 (or (and .cse22 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse38 (_ bv0 32))) (= (_ bv1 32) (select .cse38 v_arrayElimCell_102)))))))) .cse7) .cse11) .cse2) (or .cse2 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse39 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse40 (_ bv0 32))) (= (_ bv1 32) (select .cse40 v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse20) .cse7) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse41 v_arrayElimCell_106)) (= (_ bv1 32) (select .cse41 v_arrayElimCell_102))))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse20) .cse7) (or (and .cse17 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse42 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse42 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse43 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse43 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse10 .cse11 .cse26 .cse31 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse44 v_arrayElimCell_104) v_arrayElimCell_106))))))) .cse17) .cse7) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse45 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse46 v_arrayElimCell_99) v_arrayElimCell_102)) (= (select (select .cse46 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))))))) is different from true [2024-11-28 03:38:02,039 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 1724 treesize of output 1722 [2024-11-28 03:38:02,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:02,243 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 109 treesize of output 107 [2024-11-28 03:38:02,292 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 41 treesize of output 39 [2024-11-28 03:38:02,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:02,476 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 61 treesize of output 63 [2024-11-28 03:38:03,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:03,999 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 81 treesize of output 81 [2024-11-28 03:38:04,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:04,188 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 65 treesize of output 69 [2024-11-28 03:38:04,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:04,366 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 88 treesize of output 82 [2024-11-28 03:38:06,221 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 100 treesize of output 92 [2024-11-28 03:38:06,260 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 41 treesize of output 39 [2024-11-28 03:38:06,300 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 50 treesize of output 46 [2024-11-28 03:38:07,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:07,757 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 80 treesize of output 84 [2024-11-28 03:38:07,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:07,934 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 122 treesize of output 124 [2024-11-28 03:38:08,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:38:08,117 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 139 treesize of output 135 [2024-11-28 03:38:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2024-11-28 03:38:17,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:38:17,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786158828] [2024-11-28 03:38:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786158828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:38:17,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:38:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-28 03:38:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820109392] [2024-11-28 03:38:17,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:38:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:38:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:38:17,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:38:17,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=291, Unknown=8, NotChecked=190, Total=552 [2024-11-28 03:38:17,931 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2024-11-28 03:38:23,447 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|)) (.cse5 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) (_ bv0 32))))))) (.cse10 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse51 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse51 v_arrayElimCell_104) (_ bv0 32))))))))))) (.cse23 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))))) (.cse0 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse21 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))) (.cse11 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) v_arrayElimCell_102))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (.cse12 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse50 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse50 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse27 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse49 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse32 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse48 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) (.cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) v_arrayElimCell_106)))))) (.cse8 (not (= (_ bv0 1) .cse1)))) (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse0 (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) .cse1)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse2 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse2 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse3 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (or .cse0 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse4 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse4 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse6 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse6 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)))))))) .cse7) .cse8) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse9 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse9 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102))))))) .cse7) .cse8) .cse10 .cse11 .cse12 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse13 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse13 v_arrayElimCell_104) (_ bv0 32)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))) .cse8) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse14 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and .cse7 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_100) (_ bv0 32))))))))) .cse8) (or (and .cse7 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse17 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse17 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse8) (or (and .cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse19 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse19 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse20 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse20 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse21) .cse8) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse22 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse22 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and .cse23 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse24 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_100) (_ bv0 32))))))))) .cse8) .cse10 (or (and .cse23 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse25 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse8) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_104) (_ bv0 32)))))))))) .cse27 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_100) v_arrayElimCell_102)) (= (select (select .cse28 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse8 (and .cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse29 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse29 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse29 v_arrayElimCell_104) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse30 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse31 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse32 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_100) (_ bv0 32))) (= (select (select .cse33 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse21)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) (_ bv0 32)))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse36 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) v_arrayElimCell_102))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) .cse0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse38 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse38 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse11 (or (and .cse23 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse39 (_ bv0 32))) (= (_ bv1 32) (select .cse39 v_arrayElimCell_102)))))))) .cse8) .cse12) .cse0) (or .cse0 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse40 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse41 (_ bv0 32))) (= (_ bv1 32) (select .cse41 v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse21) .cse8) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse42 v_arrayElimCell_106)) (= (_ bv1 32) (select .cse42 v_arrayElimCell_102))))) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse21) .cse8) (or (and .cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse43 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse8) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse44 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse44 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse11 .cse12 .cse27 .cse32 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse45 v_arrayElimCell_104) v_arrayElimCell_106))))))) .cse18) .cse8) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse46 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse47 v_arrayElimCell_99) v_arrayElimCell_102)) (= (select (select .cse47 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32))))) is different from true [2024-11-28 03:38:39,589 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (.cse4 (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|)) (.cse14 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (.cse16 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) (_ bv0 32))))))) (.cse19 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse67 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse67 v_arrayElimCell_104) (_ bv0 32))))))))))) (.cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse3 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse30 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))) (.cse20 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) v_arrayElimCell_102))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (.cse21 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse66 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse36 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse65 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse65 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse41 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse64 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse64 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) v_arrayElimCell_106)))))) (.cse17 (not (= (_ bv0 1) .cse4))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) (_ bv4 32)))) (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse0) .cse1)) (= (_ bv0 32) .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| .cse2)) .cse3 (not (= .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse2))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse4)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse5 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse5 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse6 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_28 .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv1 32) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27)) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) .cse12)) (.cse10 (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) .cse12)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) (select (select .cse8 .cse9) .cse10)) (select (select .cse11 .cse9) .cse10))))))) (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)) (or .cse3 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse13 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse13 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse15 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)))))))) .cse16) .cse17) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse18 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse18 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102))))))) .cse16) .cse17) .cse19 .cse20 .cse21 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse22 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse22 v_arrayElimCell_104) (_ bv0 32)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))) .cse17) (not (= .cse0 .cse2)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse23 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and .cse16 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_100) (_ bv0 32))))))))) .cse17) (or (and .cse16 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse26 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse17) (or (and .cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse17) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse29 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse29 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse29 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse30) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse31 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and .cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_100) (_ bv0 32))))))))) .cse17) .cse19 (or (and .cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_104) (_ bv0 32)))))))))) .cse36 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_100) v_arrayElimCell_102)) (= (select (select .cse37 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse17 (and .cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_104) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse39 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse41 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse42 v_arrayElimCell_100) (_ bv0 32))) (= (select (select .cse42 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse42 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse17 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse43 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse43 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse30)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse44 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) (_ bv0 32)))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse45 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) v_arrayElimCell_102))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse46 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) .cse3) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse0))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse47 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse20 (or (and .cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse48 (_ bv0 32))) (= (_ bv1 32) (select .cse48 v_arrayElimCell_102)))))))) .cse17) .cse21) .cse3) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse50 (select v_arrayElimArr_27 (_ bv4 32))) (.cse49 (select v_arrayElimArr_28 (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= .cse49 |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_30 .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= .cse50 |c_ULTIMATE.start_main_~t~0#1.base|)) (= (let ((.cse54 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse51 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27)) (.cse55 (bvadd (_ bv4 32) .cse49))) (let ((.cse52 (select (select .cse51 .cse50) .cse55)) (.cse53 (bvadd (select (select .cse54 .cse50) .cse55) (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) (select (select .cse51 .cse52) .cse53)) (select (select .cse54 .cse52) .cse53)))) (_ bv1 32)) (not (= (select v_arrayElimArr_29 .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse3 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse56 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse56 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse56 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse57 (_ bv0 32))) (= (_ bv1 32) (select .cse57 v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse30) .cse17) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse58 v_arrayElimCell_106)) (= (_ bv1 32) (select .cse58 v_arrayElimCell_102))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse30) .cse17) (or (and .cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse59 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse59 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse60 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse60 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse20 .cse21 .cse36 .cse41 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse61 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse61 v_arrayElimCell_104) v_arrayElimCell_106))))))) .cse27) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse62 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse62 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse62 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse63 v_arrayElimCell_99) v_arrayElimCell_102)) (= (select (select .cse63 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse63 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))))) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse2) (select (select |c_#memory_$Pointer$#1.offset| .cse0) (_ bv4 32)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32))))) is different from true [2024-11-28 03:38:43,679 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (.cse4 (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|)) (.cse14 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (.cse16 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) (_ bv0 32))))))) (.cse19 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse67 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse67 v_arrayElimCell_104) (_ bv0 32))))))))))) (.cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse3 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse30 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))) (.cse20 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) v_arrayElimCell_102))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (.cse21 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse66 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse36 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse65 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse65 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse41 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse64 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse64 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) v_arrayElimCell_106)))))) (.cse17 (not (= (_ bv0 1) .cse4))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) (_ bv4 32)))) (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse0) .cse1)) (= (_ bv0 32) .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| .cse2)) .cse3 (not (= .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) .cse4)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse5 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse5 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse6 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_28 .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv1 32) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27)) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) .cse12)) (.cse10 (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) .cse12)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) (select (select .cse8 .cse9) .cse10)) (select (select .cse11 .cse9) .cse10))))))) (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)) (or .cse3 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse13 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse13 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse15 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)))))))) .cse16) .cse17) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse18 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse18 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102))))))) .cse16) .cse17) .cse19 .cse20 .cse21 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse22 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse22 v_arrayElimCell_104) (_ bv0 32)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))) .cse17) (not (= .cse0 .cse2)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse23 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and .cse16 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_100) (_ bv0 32))))))))) .cse17) (or (and .cse16 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse26 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse17) (or (and .cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse17) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse29 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse29 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse29 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse30) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse31 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and .cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_100) (_ bv0 32))))))))) .cse17) .cse19 (or (and .cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse34 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_104) (_ bv0 32)))))))))) .cse36 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_100) v_arrayElimCell_102)) (= (select (select .cse37 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse17 (and .cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_104) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse39 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse41 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse42 v_arrayElimCell_100) (_ bv0 32))) (= (select (select .cse42 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse42 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse17 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse43 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse43 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse30)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse44 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) (_ bv0 32)))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse45 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) v_arrayElimCell_102))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse46 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) .cse3) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse0))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse47 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse20 (or (and .cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse48 (_ bv0 32))) (= (_ bv1 32) (select .cse48 v_arrayElimCell_102)))))))) .cse17) .cse21) .cse3) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse50 (select v_arrayElimArr_27 (_ bv4 32))) (.cse49 (select v_arrayElimArr_28 (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= .cse49 |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_30 .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= .cse50 |c_ULTIMATE.start_main_~t~0#1.base|)) (= (let ((.cse54 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse51 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27)) (.cse55 (bvadd (_ bv4 32) .cse49))) (let ((.cse52 (select (select .cse51 .cse50) .cse55)) (.cse53 (bvadd (select (select .cse54 .cse50) .cse55) (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) (select (select .cse51 .cse52) .cse53)) (select (select .cse54 .cse52) .cse53)))) (_ bv1 32)) (not (= (select v_arrayElimArr_29 .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse3 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse56 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse56 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse56 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse57 (_ bv0 32))) (= (_ bv1 32) (select .cse57 v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse30) .cse17) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse58 v_arrayElimCell_106)) (= (_ bv1 32) (select .cse58 v_arrayElimCell_102))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse30) .cse17) (or (and .cse27 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse59 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse59 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse60 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse60 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse20 .cse21 .cse36 .cse41 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse61 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse61 v_arrayElimCell_104) v_arrayElimCell_106))))))) .cse27) .cse17) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse62 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse62 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse62 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse63 v_arrayElimCell_99) v_arrayElimCell_102)) (= (select (select .cse63 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse63 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))))) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse2) (select (select |c_#memory_$Pointer$#1.offset| .cse0) (_ bv4 32)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32))))) is different from true [2024-11-28 03:38:49,614 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32)))) (let ((.cse6 (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|)) (.cse16 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) (_ bv4 32))) (.cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) (_ bv0 32))))))) (.cse21 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse69 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse69 v_arrayElimCell_104) (_ bv0 32))))))))))) (.cse34 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))))) (.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse5 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse32 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))) (.cse22 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) v_arrayElimCell_102))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|)))))) (.cse23 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse68 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse68 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse38 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse67 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse67 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))) (.cse43 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse66 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse66 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) (.cse29 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) v_arrayElimCell_104) v_arrayElimCell_106)))))) (.cse19 (not (= (_ bv0 1) .cse6))) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) (_ bv4 32)))) (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_99) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse1) .cse2)) (= (_ bv0 32) .cse3) (= (_ bv0 32) .cse2) (not (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| .cse4)) .cse5 (not (= .cse1 |c_ULTIMATE.start_main_~t~0#1.base|)) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse0) (select (select |c_#memory_$Pointer$#1.offset| .cse4) (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse4))) (not (= .cse1 .cse0)) (= (_ bv0 1) (bvadd (_ bv1 1) .cse6)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse7 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse7 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse7 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse8 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_28 .cse9) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse9) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv1 32) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28)) (.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27)) (.cse14 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~p~0#1.base|) .cse14)) (.cse12 (bvadd (_ bv4 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) .cse14)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) (select (select .cse10 .cse11) .cse12)) (select (select .cse13 .cse11) .cse12))))))) (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (or .cse5 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse15 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse17 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse17 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)))))))) .cse18) .cse19) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse20 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse20 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102))))))) .cse18) .cse19) .cse21 .cse22 .cse23 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse24 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse24 v_arrayElimCell_104) (_ bv0 32)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))))) (or (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))))) .cse19) (not (= .cse1 .cse4)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse25 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse4 .cse0)) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse26 v_arrayElimCell_104) (_ bv0 32)))))))))) (or (and .cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse27 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse27 v_arrayElimCell_100) (_ bv0 32))))))))) .cse19) (or (and .cse18 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_104) (_ bv0 32))) (= (_ bv1 32) (select (select .cse28 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse19) (or (and .cse29 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse30 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse19) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse31 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse32) .cse19) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse33 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and .cse34 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse35 v_arrayElimCell_100) (_ bv0 32))))))))) .cse19) .cse21 (or (and .cse34 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse36 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse36 v_arrayElimCell_100) v_arrayElimCell_102)))))))) .cse19) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_104) (_ bv0 32)))))))))) .cse38 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse39 v_arrayElimCell_100) v_arrayElimCell_102)) (= (select (select .cse39 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse19 (and .cse29 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_104) v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse41 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse41 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse42 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse42 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99))) .cse43 (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse44 v_arrayElimCell_100) (_ bv0 32))) (= (select (select .cse44 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse44 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (or .cse19 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse45 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse45 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) .cse32)) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse46 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) (_ bv0 32)))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_99) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse47 v_arrayElimCell_100) (_ bv0 32))) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_99 v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) v_arrayElimCell_100) v_arrayElimCell_102))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse48 v_arrayElimCell_100) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse48 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106)))))))))) .cse5) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse1))) (or (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse49 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse22 (or (and .cse34 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse50 (_ bv0 32))) (= (_ bv1 32) (select .cse50 v_arrayElimCell_102)))))))) .cse19) .cse23) .cse5) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse52 (select v_arrayElimArr_27 (_ bv4 32))) (.cse51 (select v_arrayElimArr_28 (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= .cse51 |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_30 .cse9) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= .cse52 |c_ULTIMATE.start_main_~t~0#1.base|)) (= (let ((.cse56 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse53 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27)) (.cse57 (bvadd (_ bv4 32) .cse51))) (let ((.cse54 (select (select .cse53 .cse52) .cse57)) (.cse55 (bvadd (select (select .cse56 .cse52) .cse57) (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) (select (select .cse53 .cse54) .cse55)) (select (select .cse56 .cse54) .cse55)))) (_ bv1 32)) (not (= (select v_arrayElimArr_29 .cse9) |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse5 (and (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse58 v_arrayElimCell_99) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse58 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse58 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse59 (_ bv0 32))) (= (_ bv1 32) (select .cse59 v_arrayElimCell_106))))) (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse32) .cse19) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse60 v_arrayElimCell_106)) (= (_ bv1 32) (select .cse60 v_arrayElimCell_102))))) (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse32) .cse19) (or (and .cse29 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse61 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_102)) (= (_ bv1 32) (select (select .cse61 v_arrayElimCell_104) v_arrayElimCell_106)))))))) .cse19) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse62 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse62 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse62 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) .cse22 .cse23 .cse38 .cse43 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse63 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32))) (= (_ bv1 32) (select (select .cse63 v_arrayElimCell_104) v_arrayElimCell_106))))))) .cse29) .cse19) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (select (select .cse64 v_arrayElimCell_99) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse64 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (select (select .cse64 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_106))))))))) (forall ((v_arrayElimCell_99 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_99))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_99 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_104 (_ BitVec 32)) (v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_106 (_ BitVec 32)) (v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_258) v_arrayElimCell_99 v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_270))) (or (= (_ bv1 32) (select (select .cse65 v_arrayElimCell_99) v_arrayElimCell_102)) (= (select (select .cse65 v_arrayElimCell_104) v_arrayElimCell_106) (_ bv1 32)) (= (_ bv1 32) (select (select .cse65 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))))) (= (_ bv1 32) (select (select |c_#memory_int#1| .cse4) .cse3)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32)))))) is different from true [2024-11-28 03:38:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:38:59,072 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2024-11-28 03:38:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:38:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 40 [2024-11-28 03:38:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:38:59,073 INFO L225 Difference]: With dead ends: 50 [2024-11-28 03:38:59,073 INFO L226 Difference]: Without dead ends: 48 [2024-11-28 03:38:59,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=173, Invalid=662, Unknown=13, NotChecked=558, Total=1406 [2024-11-28 03:38:59,075 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:38:59,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 149 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 259 Unchecked, 7.4s Time] [2024-11-28 03:38:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-28 03:38:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-11-28 03:38:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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) [2024-11-28 03:38:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-28 03:38:59,086 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2024-11-28 03:38:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:38:59,086 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-28 03:38:59,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2024-11-28 03:38:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-28 03:38:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 03:38:59,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:38:59,087 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-28 03:38:59,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 03:38:59,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:38:59,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:38:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:38:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -121910394, now seen corresponding path program 7 times [2024-11-28 03:38:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:38:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242595598] [2024-11-28 03:38:59,289 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:38:59,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:38:59,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:38:59,294 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:38:59,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:38:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:38:59,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-28 03:38:59,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:38:59,884 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 [2024-11-28 03:39:00,384 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 [2024-11-28 03:39:00,495 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 [2024-11-28 03:39:01,507 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:39:01,508 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 [2024-11-28 03:39:02,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:39:02,475 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 21 treesize of output 23 [2024-11-28 03:39:02,573 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 [2024-11-28 03:39:02,673 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 20 treesize of output 15 [2024-11-28 03:39:04,275 INFO L349 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2024-11-28 03:39:04,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2024-11-28 03:39:05,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:39:05,950 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:39:05,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 59 [2024-11-28 03:39:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 03:39:06,206 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 [2024-11-28 03:39:08,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:08,805 INFO L349 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2024-11-28 03:39:08,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2024-11-28 03:39:10,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:39:10,700 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2024-11-28 03:39:10,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 83 [2024-11-28 03:39:10,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:10,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:10,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2024-11-28 03:39:11,043 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 [2024-11-28 03:39:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:39:22,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:25,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:25,847 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 101 treesize of output 95 [2024-11-28 03:39:25,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:25,923 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 75 [2024-11-28 03:39:26,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:26,124 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 101 treesize of output 90 [2024-11-28 03:39:26,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:26,202 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 81 treesize of output 75 [2024-11-28 03:39:30,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:30,314 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 122 treesize of output 111 [2024-11-28 03:39:30,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:30,413 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 102 treesize of output 96 [2024-11-28 03:39:30,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:30,713 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 122 treesize of output 116 [2024-11-28 03:39:30,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:30,801 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 107 treesize of output 96 [2024-11-28 03:39:31,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_46| (_ BitVec 32)) (v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (= (_ bv0 32) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_43) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_37)) (.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_42) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_36))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)) (.cse3 (bvadd (_ bv4 32) (select (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse0 .cse2) .cse3)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_42 .cse4))) (not (= (select v_arrayElimArr_36 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_43 .cse4))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_46| (_ BitVec 32)) (v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_39 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (= (_ bv0 32) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_41) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_39)) (.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_40) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_38))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)) (.cse7 (bvadd (select (select .cse8 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4) (_ bv4 32)))) (select (select .cse5 (select (select .cse5 .cse6) .cse7)) (bvadd (select (select .cse8 .cse6) .cse7) (_ bv4 32)))))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_38 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_41 .cse4))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_40 .cse4))))))) is different from false [2024-11-28 03:39:32,140 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_46| (_ BitVec 32)) (v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select v_arrayElimArr_38 (_ bv4 32)))) (or (= (_ bv0 32) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_arrayElimArr_41) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_39)) (.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse4 v_arrayElimArr_40) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_38))) (let ((.cse1 (select (select .cse0 .cse4) (_ bv4 32))) (.cse2 (bvadd (select (select .cse3 .cse4) (_ bv4 32)) (_ bv4 32)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_41 (_ bv4 32)))) (not (= (select (store |c_#valid| .cse4 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_46|) (_ bv0 1))) (not (= (select v_arrayElimArr_40 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 32) (select v_arrayElimArr_39 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse4)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_46| (_ BitVec 32)) (v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_36 (_ bv4 32)))) (or (not (= (select v_arrayElimArr_37 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_arrayElimArr_43) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_37)) (.cse6 (store (store |c_#memory_$Pointer$#1.base| .cse9 v_arrayElimArr_42) |v_ULTIMATE.start_main_~t~0#1.base_46| v_arrayElimArr_36))) (let ((.cse7 (select (select .cse6 .cse9) (_ bv4 32))) (.cse8 (bvadd (_ bv4 32) (select (select .cse5 .cse9) (_ bv4 32))))) (select (select .cse5 (select (select .cse6 .cse7) .cse8)) (bvadd (_ bv4 32) (select (select .cse5 .cse7) .cse8)))))) (not (= (_ bv0 1) (select |c_#valid| .cse9))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_43 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_42 (_ bv4 32)))))))) is different from false [2024-11-28 03:39:33,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:33,264 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 157 treesize of output 151 [2024-11-28 03:39:33,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:33,341 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 142 treesize of output 131 [2024-11-28 03:39:33,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:33,773 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 157 treesize of output 146 [2024-11-28 03:39:33,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:33,853 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 137 treesize of output 131 [2024-11-28 03:39:49,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:49,030 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 206 treesize of output 177 [2024-11-28 03:39:49,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:49,165 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 166 treesize of output 147 [2024-11-28 03:39:49,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:49,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:50,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:50,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:50,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:50,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:50,516 INFO L224 Elim1Store]: Index analysis took 606 ms [2024-11-28 03:39:50,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:50,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:54,341 INFO L349 Elim1Store]: treesize reduction 501, result has 20.3 percent of original size [2024-11-28 03:39:54,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 8 new quantified variables, introduced 47 case distinctions, treesize of input 84208 treesize of output 76829 [2024-11-28 03:39:55,228 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 19229 treesize of output 19223 [2024-11-28 03:39:55,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:55,675 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 182 treesize of output 166 [2024-11-28 03:39:55,757 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 172 treesize of output 140 [2024-11-28 03:39:56,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:56,090 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 130 treesize of output 126 [2024-11-28 03:39:56,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:39:56,358 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 105 [2024-11-28 03:39:56,437 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 126 treesize of output 112 [2024-11-28 03:39:56,507 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 128 treesize of output 116 [2024-11-28 03:40:04,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:04,948 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 206 treesize of output 187 [2024-11-28 03:40:05,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:05,072 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 176 treesize of output 147 [2024-11-28 03:40:05,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:05,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:05,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:05,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:05,216 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 79 treesize of output 73 [2024-11-28 03:40:05,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:05,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:05,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:40:05,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:40:05,478 INFO L224 Elim1Store]: Index analysis took 145 ms [2024-11-28 03:40:05,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:05,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33260 treesize of output 31998 [2024-11-28 03:40:06,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:06,584 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 1641 treesize of output 1303 [2024-11-28 03:40:06,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:06,879 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 1280 treesize of output 1164 [2024-11-28 03:40:07,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:07,190 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 1167 treesize of output 913 [2024-11-28 03:40:07,270 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 37 treesize of output 29 [2024-11-28 03:41:19,370 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:41:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-28 03:41:27,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:41:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242595598] [2024-11-28 03:41:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242595598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:41:27,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:41:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-28 03:41:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678815092] [2024-11-28 03:41:27,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:41:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 03:41:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:41:27,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 03:41:27,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=425, Unknown=23, NotChecked=86, Total=600 [2024-11-28 03:41:27,053 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 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) [2024-11-28 03:41:37,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:41:43,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:41:46,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:41:53,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:42:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:42:02,278 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-28 03:42:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:42:02,286 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 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 44 [2024-11-28 03:42:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:42:02,287 INFO L225 Difference]: With dead ends: 76 [2024-11-28 03:42:02,287 INFO L226 Difference]: Without dead ends: 53 [2024-11-28 03:42:02,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=73, Invalid=463, Unknown=24, NotChecked=90, Total=650 [2024-11-28 03:42:02,288 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:42:02,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 94 Unchecked, 32.8s Time] [2024-11-28 03:42:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-28 03:42:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-28 03:42:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 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) [2024-11-28 03:42:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-11-28 03:42:02,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2024-11-28 03:42:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:42:02,298 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-28 03:42:02,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 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) [2024-11-28 03:42:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-11-28 03:42:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 03:42:02,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:42:02,299 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2024-11-28 03:42:02,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 03:42:02,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:42:02,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:42:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:42:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1593556460, now seen corresponding path program 8 times [2024-11-28 03:42:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:42:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370901043] [2024-11-28 03:42:02,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:42:02,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:42:02,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:42:02,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:42:02,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_115ce39d-a366-4300-abc9-15394b917d15/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:42:02,698 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:42:02,698 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:42:02,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-28 03:42:02,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:42:02,770 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 [2024-11-28 03:42:03,064 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 22 treesize of output 7 [2024-11-28 03:42:04,441 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:42:04,442 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 [2024-11-28 03:42:05,453 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 24 treesize of output 19 [2024-11-28 03:42:05,638 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 15 treesize of output 1 [2024-11-28 03:42:05,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:42:08,141 INFO L349 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2024-11-28 03:42:08,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2024-11-28 03:42:10,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:42:10,360 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 75 treesize of output 52 [2024-11-28 03:42:10,592 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 33 treesize of output 35 [2024-11-28 03:42:10,650 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 [2024-11-28 03:42:10,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-28 03:42:13,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:14,815 INFO L349 Elim1Store]: treesize reduction 102, result has 36.3 percent of original size [2024-11-28 03:42:14,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 83 [2024-11-28 03:42:17,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:42:17,765 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:42:17,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 83 [2024-11-28 03:42:18,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:18,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:18,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-28 03:42:18,192 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 40 treesize of output 35 [2024-11-28 03:42:18,360 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 [2024-11-28 03:42:21,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:21,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:21,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:21,470 INFO L224 Elim1Store]: Index analysis took 118 ms [2024-11-28 03:42:22,330 INFO L349 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2024-11-28 03:42:22,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 64 [2024-11-28 03:42:25,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2024-11-28 03:42:25,981 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2024-11-28 03:42:25,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 98 [2024-11-28 03:42:26,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2024-11-28 03:42:26,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:26,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:26,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:42:26,482 INFO L224 Elim1Store]: Index analysis took 176 ms [2024-11-28 03:42:26,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 83 [2024-11-28 03:42:26,542 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 [2024-11-28 03:42:47,157 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-28 03:42:47,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 85 [2024-11-28 03:42:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-28 03:42:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:42:49,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:42:54,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:42:54,689 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 206 treesize of output 180 [2024-11-28 03:42:54,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:42:54,833 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 171 treesize of output 145 [2024-11-28 03:42:55,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_55 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_56 .cse0))) (= (_ bv1 32) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_56)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_55)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse6 (bvadd (select (select .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7) (_ bv4 32)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_439) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2024-11-28 03:42:55,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_56| (_ BitVec 32)) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_56|))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_56 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_56)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_55)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) .cse6)) (.cse5 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse6)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (bvadd (select (select .cse3 .cse4) .cse5) (_ bv4 32)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_56| v_ArrVal_439) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (_ bv1 32)))) is different from false [2024-11-28 03:42:56,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:42:56,527 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 267 treesize of output 241 [2024-11-28 03:42:56,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:42:56,671 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 232 treesize of output 206 [2024-11-28 03:42:57,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_431 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_56| (_ BitVec 32)) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse0 (select v_arrayElimArr_56 (_ bv4 32)))) (or (not (= .cse0 |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_56|))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_57 .cse1))) (not (= (select v_arrayElimArr_55 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_58 .cse1))) (= (_ bv1 32) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_58) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_56)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_57) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_55)) (.cse8 (bvadd (_ bv4 32) .cse0))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse8)) (.cse7 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~t~0#1.base|) .cse8)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_431) |v_ULTIMATE.start_main_~t~0#1.base_56| v_ArrVal_439) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2024-11-28 03:42:58,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_431 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_56| (_ BitVec 32)) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_55 (_ bv4 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_58 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse0))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_57 (_ bv4 32)))) (not (= (_ bv0 1) (select (store |c_#valid| .cse0 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_56|))) (= (_ bv1 32) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_58) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_56)) (.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_57) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_55))) (let ((.cse5 (select (select .cse1 .cse0) (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) (select (select .cse4 .cse0) (_ bv4 32))))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_431) |v_ULTIMATE.start_main_~t~0#1.base_56| v_ArrVal_439) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) (not (= (_ bv0 32) (select v_arrayElimArr_56 (_ bv4 32))))))) is different from false [2024-11-28 03:42:59,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:42:59,456 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 326 treesize of output 300 [2024-11-28 03:42:59,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:42:59,594 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 291 treesize of output 265 [2024-11-28 03:43:00,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_431 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_56| (_ BitVec 32)) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse1 (select v_arrayElimArr_55 (_ bv4 32)))) (or (not (= (select v_arrayElimArr_60 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| .cse1))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_57 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_59 .cse0))) (not (= (select v_arrayElimArr_58 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (= (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_59) .cse1 v_arrayElimArr_58) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_56)) (.cse2 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_60) .cse1 v_arrayElimArr_57) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_55))) (let ((.cse6 (select (select .cse2 .cse1) (_ bv4 32))) (.cse7 (bvadd (_ bv4 32) (select (select .cse5 .cse1) (_ bv4 32))))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_420) .cse1 v_ArrVal_431) |v_ULTIMATE.start_main_~t~0#1.base_56| v_ArrVal_439) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (_ bv1 32)) (not (= (_ bv0 1) (select (store |c_#valid| .cse1 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_56|))) (not (= (_ bv0 32) (select v_arrayElimArr_56 (_ bv4 32))))))) is different from false [2024-11-28 03:43:01,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_431 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_56| (_ BitVec 32)) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_57 (_ bv4 32)))) (let ((.cse0 (store |c_#valid| .cse2 (_ bv1 1))) (.cse1 (select v_arrayElimArr_55 (_ bv4 32)))) (or (not (= (select .cse0 .cse1) (_ bv0 1))) (not (= (select v_arrayElimArr_60 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (_ bv0 1) (select (store .cse0 .cse1 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_56|))) (not (= (_ bv0 32) (select v_arrayElimArr_58 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse2))) (= (_ bv1 32) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_59) .cse1 v_arrayElimArr_58) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_56)) (.cse3 (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_60) .cse1 v_arrayElimArr_57) |v_ULTIMATE.start_main_~t~0#1.base_56| v_arrayElimArr_55))) (let ((.cse7 (select (select .cse3 .cse1) (_ bv4 32))) (.cse8 (bvadd (_ bv4 32) (select (select .cse6 .cse1) (_ bv4 32))))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 .cse7) .cse8)))) (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_420) .cse1 v_ArrVal_431) |v_ULTIMATE.start_main_~t~0#1.base_56| v_ArrVal_439) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_59 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_56 (_ bv4 32)))))))) is different from false [2024-11-28 03:43:03,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:03,418 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 429 treesize of output 370 [2024-11-28 03:43:03,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:03,564 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 359 treesize of output 300 [2024-11-28 03:43:03,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:03,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:03,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:03,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:03,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:04,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:04,007 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6184 treesize of output 5970 [2024-11-28 03:43:04,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:04,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:04,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:43:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:43:04,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10240 treesize of output 10074 [2024-11-28 03:43:04,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:04,936 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 3337 treesize of output 2953 [2024-11-28 03:43:05,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:05,337 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 2937 treesize of output 2547 [2024-11-28 03:43:05,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:05,744 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 1253 treesize of output 1129 [2024-11-28 03:43:06,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:06,160 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 2390 treesize of output 2138 [2024-11-28 03:43:06,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:06,522 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 2170 treesize of output 2090 [2024-11-28 03:43:06,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:43:06,929 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 1086 treesize of output 972