./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC --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 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 18:28:09,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 18:28:09,630 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 18:28:09,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 18:28:09,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 18:28:09,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 18:28:09,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 18:28:09,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 18:28:09,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 18:28:09,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 18:28:09,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 18:28:09,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 18:28:09,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 18:28:09,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 18:28:09,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 18:28:09,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 18:28:09,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 18:28:09,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 18:28:09,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 18:28:09,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 18:28:09,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 18:28:09,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 18:28:09,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 18:28:09,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:28:09,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:28:09,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:28:09,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:28:09,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 18:28:09,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:28:09,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 18:28:09,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 18:28:09,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 18:28:09,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 18:28:09,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 18:28:09,694 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2024-11-23 18:28:10,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 18:28:10,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 18:28:10,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 18:28:10,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 18:28:10,073 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 18:28:10,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-23 18:28:13,538 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/f26fcbe05/a82973eb74fc48c7924285092bfece3c/FLAG8a454fe30 [2024-11-23 18:28:13,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 18:28:13,895 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-23 18:28:13,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/f26fcbe05/a82973eb74fc48c7924285092bfece3c/FLAG8a454fe30 [2024-11-23 18:28:13,924 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/f26fcbe05/a82973eb74fc48c7924285092bfece3c [2024-11-23 18:28:13,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 18:28:13,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 18:28:13,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 18:28:13,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 18:28:13,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 18:28:13,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:28:13" (1/1) ... [2024-11-23 18:28:13,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7f8702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:13, skipping insertion in model container [2024-11-23 18:28:13,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:28:13" (1/1) ... [2024-11-23 18:28:13,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 18:28:14,389 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-23 18:28:14,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:28:14,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 18:28:14,472 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-23 18:28:14,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:28:14,509 INFO L204 MainTranslator]: Completed translation [2024-11-23 18:28:14,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14 WrapperNode [2024-11-23 18:28:14,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 18:28:14,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 18:28:14,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 18:28:14,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 18:28:14,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,565 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-11-23 18:28:14,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 18:28:14,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 18:28:14,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 18:28:14,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 18:28:14,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,617 INFO L175 MemorySlicer]: Split 38 memory accesses to 4 slices as follows [2, 13, 16, 7]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 15 writes are split as follows [0, 3, 8, 4]. [2024-11-23 18:28:14,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 18:28:14,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 18:28:14,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 18:28:14,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 18:28:14,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (1/1) ... [2024-11-23 18:28:14,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:28:14,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:14,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 18:28:14,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 18:28:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-23 18:28:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-23 18:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 18:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 18:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 18:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 18:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 18:28:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 18:28:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 18:28:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-23 18:28:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 18:28:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 18:28:14,915 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 18:28:14,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 18:28:14,972 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-23 18:28:15,387 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-23 18:28:15,387 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 18:28:15,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 18:28:15,404 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-23 18:28:15,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:28:15 BoogieIcfgContainer [2024-11-23 18:28:15,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 18:28:15,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 18:28:15,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 18:28:15,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 18:28:15,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:28:13" (1/3) ... [2024-11-23 18:28:15,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0666b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:28:15, skipping insertion in model container [2024-11-23 18:28:15,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:28:14" (2/3) ... [2024-11-23 18:28:15,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0666b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:28:15, skipping insertion in model container [2024-11-23 18:28:15,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:28:15" (3/3) ... [2024-11-23 18:28:15,418 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2024-11-23 18:28:15,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 18:28:15,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_and_skiplist_2lvl-2.i that has 2 procedures, 47 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-23 18:28:15,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 18:28:15,530 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;@799e2586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 18:28:15,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 18:28:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:28:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 18:28:15,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:15,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:15,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:15,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash 129654765, now seen corresponding path program 1 times [2024-11-23 18:28:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014792198] [2024-11-23 18:28:15,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:15,769 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-23 18:28:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014792198] [2024-11-23 18:28:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014792198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:28:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:28:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 18:28:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788418586] [2024-11-23 18:28:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:28:15,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 18:28:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:15,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 18:28:15,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 18:28:15,814 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-23 18:28:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:15,841 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-11-23 18:28:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 18:28:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-23 18:28:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:15,851 INFO L225 Difference]: With dead ends: 79 [2024-11-23 18:28:15,851 INFO L226 Difference]: Without dead ends: 16 [2024-11-23 18:28:15,856 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-23 18:28:15,862 INFO L435 NwaCegarLoop]: 56 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, 56 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-23 18:28:15,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:28:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-23 18:28:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-23 18:28:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:28:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-23 18:28:15,891 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2024-11-23 18:28:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:15,891 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-23 18:28:15,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-23 18:28:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-23 18:28:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 18:28:15,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:15,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 18:28:15,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:15,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1410165730, now seen corresponding path program 1 times [2024-11-23 18:28:15,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:15,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475776027] [2024-11-23 18:28:15,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:16,368 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-23 18:28:16,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:16,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475776027] [2024-11-23 18:28:16,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475776027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:28:16,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:28:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 18:28:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631319364] [2024-11-23 18:28:16,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:28:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:28:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:16,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:28:16,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:28:16,373 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 18:28:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:16,485 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-23 18:28:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:28:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-11-23 18:28:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:16,487 INFO L225 Difference]: With dead ends: 28 [2024-11-23 18:28:16,487 INFO L226 Difference]: Without dead ends: 26 [2024-11-23 18:28:16,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:28:16,488 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:16,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:28:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-23 18:28:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-23 18:28:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-23 18:28:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-23 18:28:16,494 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2024-11-23 18:28:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:16,494 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-23 18:28:16,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 18:28:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-23 18:28:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 18:28:16,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:16,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:16,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 18:28:16,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2125731432, now seen corresponding path program 1 times [2024-11-23 18:28:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847090551] [2024-11-23 18:28:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847090551] [2024-11-23 18:28:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847090551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448511182] [2024-11-23 18:28:17,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:17,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:17,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:17,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:17,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 18:28:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:17,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-23 18:28:17,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:17,310 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-23 18:28:17,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-23 18:28:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:17,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:17,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-11-23 18:28:17,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:28:17,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:28:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448511182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:28:17,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:28:17,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 8 [2024-11-23 18:28:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633734006] [2024-11-23 18:28:17,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:28:17,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 18:28:17,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:17,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 18:28:17,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:28:17,572 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-23 18:28:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:17,681 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-23 18:28:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:28:17,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 15 [2024-11-23 18:28:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:17,682 INFO L225 Difference]: With dead ends: 33 [2024-11-23 18:28:17,682 INFO L226 Difference]: Without dead ends: 21 [2024-11-23 18:28:17,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:28:17,684 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:17,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:28:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-23 18:28:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-23 18:28:17,691 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-23 18:28:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-23 18:28:17,693 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2024-11-23 18:28:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:17,694 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-23 18:28:17,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-23 18:28:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-23 18:28:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-23 18:28:17,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:17,695 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:17,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 18:28:17,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:17,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash 963419155, now seen corresponding path program 1 times [2024-11-23 18:28:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:17,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138326175] [2024-11-23 18:28:17,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138326175] [2024-11-23 18:28:18,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138326175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087814997] [2024-11-23 18:28:18,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:18,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:18,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:18,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 18:28:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:18,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-23 18:28:18,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:18,474 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-23 18:28:18,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:28:18,642 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-23 18:28:18,669 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-23 18:28:18,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-23 18:28:18,797 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-23 18:28:18,804 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 16 treesize of output 8 [2024-11-23 18:28:18,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 18:28:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:18,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:18,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_114 (Array Int Int))) (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-23 18:28:18,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (not (= v_ArrVal_111 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_111 .cse0))))) (= (select (select (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-23 18:28:19,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:19,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 134 [2024-11-23 18:28:19,085 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 24 treesize of output 20 [2024-11-23 18:28:19,151 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-23 18:28:19,164 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 102 treesize of output 98 [2024-11-23 18:28:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-23 18:28:19,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087814997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:28:19,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:28:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-23 18:28:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067585077] [2024-11-23 18:28:19,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:28:19,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-23 18:28:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:19,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 18:28:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2024-11-23 18:28:19,305 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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-23 18:28:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:19,622 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-23 18:28:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 18:28:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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 16 [2024-11-23 18:28:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:19,624 INFO L225 Difference]: With dead ends: 33 [2024-11-23 18:28:19,624 INFO L226 Difference]: Without dead ends: 31 [2024-11-23 18:28:19,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=296, Unknown=2, NotChecked=74, Total=462 [2024-11-23 18:28:19,625 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:19,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 72 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2024-11-23 18:28:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-23 18:28:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-23 18:28:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-23 18:28:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-23 18:28:19,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2024-11-23 18:28:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-23 18:28:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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-23 18:28:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-23 18:28:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-23 18:28:19,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:19,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:19,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 18:28:19,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:19,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1135461913, now seen corresponding path program 1 times [2024-11-23 18:28:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987038668] [2024-11-23 18:28:19,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:20,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987038668] [2024-11-23 18:28:20,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987038668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827169223] [2024-11-23 18:28:20,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:28:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:20,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:20,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:20,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 18:28:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:28:20,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-23 18:28:20,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:20,851 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-23 18:28:20,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:28:20,947 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-23 18:28:21,027 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-23 18:28:21,034 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-23 18:28:21,153 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:28:21,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2024-11-23 18:28:21,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-11-23 18:28:21,171 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 32 treesize of output 19 [2024-11-23 18:28:21,267 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-23 18:28:21,274 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-23 18:28:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:21,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:21,356 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 199 treesize of output 177 [2024-11-23 18:28:21,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_175 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_174 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-23 18:28:21,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:21,482 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-23 18:28:21,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:21,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-23 18:28:21,524 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 11 treesize of output 7 [2024-11-23 18:28:21,570 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:28:21,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-23 18:28:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-23 18:28:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827169223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:28:21,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:28:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-23 18:28:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354283120] [2024-11-23 18:28:21,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:28:21,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-23 18:28:21,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:21,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 18:28:21,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-23 18:28:21,809 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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-23 18:28:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:22,261 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-23 18:28:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 18:28:22,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 20 [2024-11-23 18:28:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:22,262 INFO L225 Difference]: With dead ends: 37 [2024-11-23 18:28:22,263 INFO L226 Difference]: Without dead ends: 35 [2024-11-23 18:28:22,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=383, Unknown=1, NotChecked=40, Total=506 [2024-11-23 18:28:22,264 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:22,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2024-11-23 18:28:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-23 18:28:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-23 18:28:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 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-23 18:28:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-23 18:28:22,276 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2024-11-23 18:28:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:22,278 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-23 18:28:22,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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-23 18:28:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-23 18:28:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-23 18:28:22,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:22,279 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:22,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 18:28:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:22,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 329835138, now seen corresponding path program 2 times [2024-11-23 18:28:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243556560] [2024-11-23 18:28:22,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:28:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:22,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:28:22,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243556560] [2024-11-23 18:28:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243556560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581734958] [2024-11-23 18:28:23,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:28:23,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:23,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:23,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 18:28:23,401 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:28:23,401 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:23,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-23 18:28:23,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-23 18:28:23,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 18:28:23,524 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 18:28:23,525 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-23 18:28:23,672 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 23 treesize of output 11 [2024-11-23 18:28:23,785 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-23 18:28:23,786 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 16 treesize of output 18 [2024-11-23 18:28:23,798 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 16 treesize of output 11 [2024-11-23 18:28:23,885 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 16 treesize of output 11 [2024-11-23 18:28:23,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 18:28:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:23,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:24,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_272) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_266 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_266 .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)))) is different from false [2024-11-23 18:28:24,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 254 [2024-11-23 18:28:24,269 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 118 treesize of output 114 [2024-11-23 18:28:24,280 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 114 treesize of output 106 [2024-11-23 18:28:24,414 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 124 [2024-11-23 18:28:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-23 18:28:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581734958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:28:26,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:28:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-23 18:28:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044621794] [2024-11-23 18:28:26,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:28:26,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-23 18:28:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:26,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-23 18:28:26,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=265, Unknown=12, NotChecked=34, Total=380 [2024-11-23 18:28:26,930 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:28:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:27,364 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-23 18:28:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 18:28:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-23 18:28:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:27,365 INFO L225 Difference]: With dead ends: 40 [2024-11-23 18:28:27,365 INFO L226 Difference]: Without dead ends: 38 [2024-11-23 18:28:27,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=110, Invalid=388, Unknown=12, NotChecked=42, Total=552 [2024-11-23 18:28:27,367 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:27,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 64 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 2 Unknown, 28 Unchecked, 0.2s Time] [2024-11-23 18:28:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-23 18:28:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-11-23 18:28:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 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-23 18:28:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-23 18:28:27,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2024-11-23 18:28:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:27,373 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-23 18:28:27,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:28:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-23 18:28:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-23 18:28:27,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:27,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:27,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 18:28:27,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:27,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1784775393, now seen corresponding path program 2 times [2024-11-23 18:28:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811671119] [2024-11-23 18:28:27,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:28:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:27,608 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:28:27,609 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811671119] [2024-11-23 18:28:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811671119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433843931] [2024-11-23 18:28:28,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:28:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:28,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:28,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 18:28:28,618 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:28:28,618 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:28,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-23 18:28:28,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:28,631 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-23 18:28:28,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:28:28,695 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-23 18:28:28,753 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-23 18:28:28,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 18:28:28,836 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 39 treesize of output 39 [2024-11-23 18:28:28,842 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 19 treesize of output 22 [2024-11-23 18:28:28,859 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:28:28,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2024-11-23 18:28:28,874 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 18 treesize of output 17 [2024-11-23 18:28:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:29,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:29,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,251 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-23 18:28:29,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,258 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-23 18:28:29,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,274 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-23 18:28:29,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,282 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-23 18:28:29,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2024-11-23 18:28:29,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,504 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 50 treesize of output 41 [2024-11-23 18:28:29,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:29,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2024-11-23 18:28:29,935 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2024-11-23 18:28:29,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 347 [2024-11-23 18:28:30,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:30,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 182 [2024-11-23 18:28:30,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:30,133 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 125 treesize of output 97 [2024-11-23 18:28:42,340 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:28:42,341 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 60 treesize of output 1 [2024-11-23 18:28:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433843931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:28:42,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:28:42,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-23 18:28:42,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111762873] [2024-11-23 18:28:42,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:28:42,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 18:28:42,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:42,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 18:28:42,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=283, Unknown=9, NotChecked=0, Total=342 [2024-11-23 18:28:42,498 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:28:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:42,972 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-23 18:28:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 18:28:42,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-23 18:28:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:42,974 INFO L225 Difference]: With dead ends: 45 [2024-11-23 18:28:42,974 INFO L226 Difference]: Without dead ends: 29 [2024-11-23 18:28:42,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=419, Unknown=11, NotChecked=0, Total=506 [2024-11-23 18:28:42,975 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:42,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 141 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 18:28:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-23 18:28:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-23 18:28:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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-23 18:28:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-23 18:28:42,983 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2024-11-23 18:28:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:42,983 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-23 18:28:42,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:28:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-23 18:28:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-23 18:28:42,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:42,988 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:43,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 18:28:43,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:43,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2139931384, now seen corresponding path program 3 times [2024-11-23 18:28:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:43,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558266888] [2024-11-23 18:28:43,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 18:28:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:43,241 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 18:28:43,244 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558266888] [2024-11-23 18:28:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558266888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177536422] [2024-11-23 18:28:44,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 18:28:44,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:44,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:44,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:44,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 18:28:44,639 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 18:28:44,639 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:44,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-23 18:28:44,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:44,653 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-23 18:28:44,712 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 18:28:44,712 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-23 18:28:44,795 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-23 18:28:44,809 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-23 18:28:44,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 18:28:44,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-23 18:28:44,923 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-23 18:28:44,949 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-23 18:28:44,949 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 33 treesize of output 24 [2024-11-23 18:28:44,970 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-23 18:28:44,970 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-23 18:28:45,090 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-23 18:28:45,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 79 [2024-11-23 18:28:45,102 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 39 treesize of output 15 [2024-11-23 18:28:45,117 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 11 [2024-11-23 18:28:45,256 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-23 18:28:45,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2024-11-23 18:28:45,265 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 11 [2024-11-23 18:28:45,272 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 36 treesize of output 15 [2024-11-23 18:28:45,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 18:28:45,375 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 47 treesize of output 26 [2024-11-23 18:28:45,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-23 18:28:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:45,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:45,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 18:28:45,507 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_428 (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_428 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_428) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_433) (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2024-11-23 18:28:45,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:45,531 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 42 treesize of output 46 [2024-11-23 18:28:45,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:45,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 540 treesize of output 526 [2024-11-23 18:28:45,567 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 108 treesize of output 72 [2024-11-23 18:28:45,643 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 358 treesize of output 322 [2024-11-23 18:28:45,653 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 21 treesize of output 3 [2024-11-23 18:28:45,675 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 21 treesize of output 3 [2024-11-23 18:28:45,691 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 160 treesize of output 142 [2024-11-23 18:28:45,710 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 181 treesize of output 145 [2024-11-23 18:28:45,747 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 30 treesize of output 22 [2024-11-23 18:28:45,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:45,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-23 18:28:45,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:45,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 106 [2024-11-23 18:28:45,943 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 90 treesize of output 82 [2024-11-23 18:28:45,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:45,957 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 93 treesize of output 61 [2024-11-23 18:28:46,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:46,037 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 29 treesize of output 30 [2024-11-23 18:28:46,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:28:46,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:46,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-23 18:28:46,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:46,075 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 22 treesize of output 22 [2024-11-23 18:28:46,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:46,098 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 25 treesize of output 26 [2024-11-23 18:28:46,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:28:46,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:46,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-23 18:28:46,123 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 7 treesize of output 3 [2024-11-23 18:28:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-23 18:28:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177536422] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:28:46,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 18:28:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-11-23 18:28:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486332676] [2024-11-23 18:28:46,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 18:28:46,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-23 18:28:46,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:28:46,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-23 18:28:46,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=434, Unknown=3, NotChecked=86, Total=600 [2024-11-23 18:28:46,841 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 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-23 18:28:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:28:47,440 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-23 18:28:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 18:28:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 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 25 [2024-11-23 18:28:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:28:47,441 INFO L225 Difference]: With dead ends: 45 [2024-11-23 18:28:47,441 INFO L226 Difference]: Without dead ends: 43 [2024-11-23 18:28:47,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=685, Unknown=3, NotChecked=110, Total=930 [2024-11-23 18:28:47,442 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:28:47,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 155 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 243 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2024-11-23 18:28:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-23 18:28:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-23 18:28:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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-23 18:28:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-23 18:28:47,450 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2024-11-23 18:28:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:28:47,450 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-23 18:28:47,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 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-23 18:28:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-23 18:28:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 18:28:47,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:28:47,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:28:47,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 18:28:47,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:47,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:28:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:28:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1944118414, now seen corresponding path program 4 times [2024-11-23 18:28:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:28:47,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512255154] [2024-11-23 18:28:47,655 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 18:28:47,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:28:47,687 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 18:28:47,687 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:48,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:28:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512255154] [2024-11-23 18:28:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512255154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:28:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304870295] [2024-11-23 18:28:48,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 18:28:48,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:28:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:28:48,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:28:48,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 18:28:49,014 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 18:28:49,014 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:28:49,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-23 18:28:49,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:28:49,028 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-23 18:28:49,157 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 18:28:49,158 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-23 18:28:49,247 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-23 18:28:49,254 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-23 18:28:49,400 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-23 18:28:49,400 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 33 treesize of output 24 [2024-11-23 18:28:49,423 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-23 18:28:49,423 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-23 18:28:49,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:28:49,447 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 16 treesize of output 11 [2024-11-23 18:28:49,528 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-23 18:28:49,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 67 [2024-11-23 18:28:49,544 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 27 treesize of output 22 [2024-11-23 18:28:49,668 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-23 18:28:49,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 87 [2024-11-23 18:28:49,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:28:49,677 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-23 18:28:49,681 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 16 treesize of output 15 [2024-11-23 18:28:49,699 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 16 treesize of output 15 [2024-11-23 18:28:49,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-11-23 18:28:50,111 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-23 18:28:50,111 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 76 treesize of output 50 [2024-11-23 18:28:50,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-23 18:28:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:28:50,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:28:50,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:50,363 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 140 treesize of output 128 [2024-11-23 18:28:50,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:50,374 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 120 treesize of output 108 [2024-11-23 18:28:50,385 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 451 treesize of output 393 [2024-11-23 18:28:51,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse12 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse12 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_15 (Array Int Int))) (or (not (= (select v_arrayElimArr_15 .cse0) 0)) (= (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_15))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 4)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (select v_arrayElimArr_16 .cse0) 0)) (= .cse4 0)))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (forall ((v_arrayElimArr_15 (Array Int Int))) (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_15))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_15 .cse0) 0)) (= .cse6 0) (= (select (select .cse7 .cse6) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) |c_ULTIMATE.start_main_~t~0#1.base|))))) (not (= (select v_arrayElimArr_16 .cse0) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= .cse8 0) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select .cse9 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ .cse8 4))) (not (= (select v_arrayElimArr_15 .cse0) 0)))))))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (forall ((v_arrayElimArr_15 (Array Int Int))) (let ((.cse11 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16))) (select (select .cse10 .cse11) (+ (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))) (not (= (select v_arrayElimArr_15 .cse0) 0)) (= .cse11 0)))) (not (= (select v_arrayElimArr_16 .cse0) 0))))))) is different from false [2024-11-23 18:28:51,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:51,275 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 349 treesize of output 318 [2024-11-23 18:28:51,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:51,291 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 381 treesize of output 350 [2024-11-23 18:28:52,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:52,347 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 81 treesize of output 82 [2024-11-23 18:28:52,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:52,360 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 101 treesize of output 81 [2024-11-23 18:28:52,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:52,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 420 treesize of output 413 [2024-11-23 18:28:53,585 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2024-11-23 18:28:53,587 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 12 new quantified variables, introduced 55 case distinctions, treesize of input 3731 treesize of output 3778 [2024-11-23 18:28:53,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:53,823 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 675 treesize of output 543 [2024-11-23 18:28:54,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:54,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 577 treesize of output 569 [2024-11-23 18:28:54,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:54,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 528 treesize of output 536 [2024-11-23 18:28:54,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:28:54,798 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 329 treesize of output 239 [2024-11-23 18:32:25,334 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-23 18:32:25,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-23 18:32:25,336 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-23 18:32:25,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 18:32:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-23 18:32:25,538 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) 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) ... 69 more [2024-11-23 18:32:25,545 INFO L158 Benchmark]: Toolchain (without parser) took 251616.20ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 116.0MB in the beginning and 929.9MB in the end (delta: -813.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-23 18:32:25,546 INFO L158 Benchmark]: CDTParser took 1.86ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:32:25,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.05ms. Allocated memory is still 142.6MB. Free memory was 116.0MB in the beginning and 97.7MB in the end (delta: 18.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 18:32:25,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.61ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 18:32:25,547 INFO L158 Benchmark]: Boogie Preprocessor took 85.61ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:32:25,547 INFO L158 Benchmark]: RCFGBuilder took 751.63ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 72.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 18:32:25,548 INFO L158 Benchmark]: TraceAbstraction took 250135.80ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 72.5MB in the beginning and 929.9MB in the end (delta: -857.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-23 18:32:25,549 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.86ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.05ms. Allocated memory is still 142.6MB. Free memory was 116.0MB in the beginning and 97.7MB in the end (delta: 18.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.61ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.61ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 751.63ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 72.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 250135.80ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 72.5MB in the beginning and 929.9MB in the end (delta: -857.4MB). Peak memory consumption was 1.0GB. 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/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_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/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_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC --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 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 18:32:28,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 18:32:28,730 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-23 18:32:28,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 18:32:28,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 18:32:28,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 18:32:28,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 18:32:28,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 18:32:28,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 18:32:28,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 18:32:28,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 18:32:28,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 18:32:28,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 18:32:28,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 18:32:28,803 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 18:32:28,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 18:32:28,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 18:32:28,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 18:32:28,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 18:32:28,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 18:32:28,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 18:32:28,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 18:32:28,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 18:32:28,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 18:32:28,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:32:28,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:32:28,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:32:28,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:32:28,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 18:32:28,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:32:28,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:32:28,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:32:28,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:32:28,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 18:32:28,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 18:32:28,810 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 18:32:28,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 18:32:28,810 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 18:32:28,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 18:32:28,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 18:32:28,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 18:32:28,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 18:32:28,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 18:32:28,811 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2024-11-23 18:32:29,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 18:32:29,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 18:32:29,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 18:32:29,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 18:32:29,205 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 18:32:29,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-23 18:32:32,851 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/dcff4fc4a/69c54595708b4bbd85de9edb43fe18fc/FLAGe47a159b4 [2024-11-23 18:32:33,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 18:32:33,201 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-23 18:32:33,218 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/dcff4fc4a/69c54595708b4bbd85de9edb43fe18fc/FLAGe47a159b4 [2024-11-23 18:32:33,237 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/data/dcff4fc4a/69c54595708b4bbd85de9edb43fe18fc [2024-11-23 18:32:33,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 18:32:33,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 18:32:33,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 18:32:33,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 18:32:33,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 18:32:33,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:33,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfe6135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33, skipping insertion in model container [2024-11-23 18:32:33,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:33,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 18:32:33,811 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-23 18:32:33,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:32:33,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 18:32:33,909 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_ff869500-4325-41e4-96b8-c0c1dafaeca1/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-23 18:32:33,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:32:33,965 INFO L204 MainTranslator]: Completed translation [2024-11-23 18:32:33,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33 WrapperNode [2024-11-23 18:32:33,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 18:32:33,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 18:32:33,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 18:32:33,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 18:32:33,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:33,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,039 INFO L138 Inliner]: procedures = 129, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2024-11-23 18:32:34,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 18:32:34,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 18:32:34,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 18:32:34,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 18:32:34,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,114 INFO L175 MemorySlicer]: Split 38 memory accesses to 4 slices as follows [2, 13, 16, 7]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 15 writes are split as follows [0, 3, 8, 4]. [2024-11-23 18:32:34,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 18:32:34,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 18:32:34,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 18:32:34,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 18:32:34,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (1/1) ... [2024-11-23 18:32:34,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:32:34,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:34,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 18:32:34,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 18:32:34,265 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-23 18:32:34,266 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-23 18:32:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-23 18:32:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-23 18:32:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-23 18:32:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-23 18:32:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 18:32:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 18:32:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 18:32:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 18:32:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 18:32:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-23 18:32:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 18:32:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 18:32:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 18:32:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-23 18:32:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-23 18:32:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-23 18:32:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-23 18:32:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-23 18:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 18:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 18:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-23 18:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-23 18:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-23 18:32:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 18:32:34,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 18:32:34,458 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 18:32:34,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 18:32:34,517 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-23 18:32:35,297 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-23 18:32:35,297 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 18:32:35,311 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 18:32:35,311 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-23 18:32:35,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:35 BoogieIcfgContainer [2024-11-23 18:32:35,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 18:32:35,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 18:32:35,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 18:32:35,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 18:32:35,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:32:33" (1/3) ... [2024-11-23 18:32:35,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88cfe2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:32:35, skipping insertion in model container [2024-11-23 18:32:35,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:33" (2/3) ... [2024-11-23 18:32:35,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88cfe2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:32:35, skipping insertion in model container [2024-11-23 18:32:35,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:35" (3/3) ... [2024-11-23 18:32:35,325 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2024-11-23 18:32:35,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 18:32:35,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_and_skiplist_2lvl-2.i that has 2 procedures, 47 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-23 18:32:35,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 18:32:35,434 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;@1187de39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 18:32:35,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 18:32:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:32:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 18:32:35,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:35,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:35,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 129654765, now seen corresponding path program 1 times [2024-11-23 18:32:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:35,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370007443] [2024-11-23 18:32:35,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:32:35,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:35,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:35,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 18:32:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:32:35,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 18:32:35,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:35,669 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-23 18:32:35,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:32:35,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:32:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370007443] [2024-11-23 18:32:35,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370007443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:32:35,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:32:35,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 18:32:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457040962] [2024-11-23 18:32:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:32:35,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 18:32:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:32:35,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 18:32:35,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 18:32:35,712 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-23 18:32:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:32:35,740 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-11-23 18:32:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 18:32:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-23 18:32:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:32:35,749 INFO L225 Difference]: With dead ends: 79 [2024-11-23 18:32:35,750 INFO L226 Difference]: Without dead ends: 16 [2024-11-23 18:32:35,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-23 18:32:35,758 INFO L435 NwaCegarLoop]: 56 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, 56 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-23 18:32:35,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:32:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-23 18:32:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-23 18:32:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:32:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-23 18:32:35,796 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2024-11-23 18:32:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:32:35,796 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-23 18:32:35,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-23 18:32:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-23 18:32:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 18:32:35,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:35,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:35,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 18:32:35,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:35,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:36,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1410165730, now seen corresponding path program 1 times [2024-11-23 18:32:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882987375] [2024-11-23 18:32:36,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:32:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:36,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:36,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:36,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 18:32:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:32:36,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 18:32:36,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:36,348 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-23 18:32:36,419 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-23 18:32:36,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:32:36,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:32:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882987375] [2024-11-23 18:32:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882987375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:32:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:32:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 18:32:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464711881] [2024-11-23 18:32:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:32:36,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:32:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:32:36,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:32:36,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:32:36,426 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 18:32:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:32:36,682 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-23 18:32:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:32:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-11-23 18:32:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:32:36,684 INFO L225 Difference]: With dead ends: 28 [2024-11-23 18:32:36,684 INFO L226 Difference]: Without dead ends: 26 [2024-11-23 18:32:36,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:32:36,685 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:32:36,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:32:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-23 18:32:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-23 18:32:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-23 18:32:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-23 18:32:36,692 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2024-11-23 18:32:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:32:36,692 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-23 18:32:36,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-23 18:32:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-23 18:32:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 18:32:36,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:36,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:36,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 18:32:36,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:36,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2125731432, now seen corresponding path program 1 times [2024-11-23 18:32:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:36,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967879378] [2024-11-23 18:32:36,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:32:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:36,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:36,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:36,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 18:32:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:32:37,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 18:32:37,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:37,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 18:32:37,195 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-23 18:32:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:37,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:32:37,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-11-23 18:32:37,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:32:37,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:32:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:37,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:32:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967879378] [2024-11-23 18:32:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967879378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:32:37,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:32:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2024-11-23 18:32:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361693996] [2024-11-23 18:32:37,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:32:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 18:32:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:32:37,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 18:32:37,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:32:37,625 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-23 18:32:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:32:37,861 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-23 18:32:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:32:37,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 15 [2024-11-23 18:32:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:32:37,862 INFO L225 Difference]: With dead ends: 33 [2024-11-23 18:32:37,863 INFO L226 Difference]: Without dead ends: 21 [2024-11-23 18:32:37,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:32:37,866 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:32:37,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:32:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-23 18:32:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-23 18:32:37,874 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-23 18:32:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-23 18:32:37,877 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2024-11-23 18:32:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:32:37,877 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-23 18:32:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-23 18:32:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-23 18:32:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-23 18:32:37,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:37,878 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:37,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 18:32:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:38,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 963419155, now seen corresponding path program 1 times [2024-11-23 18:32:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305555064] [2024-11-23 18:32:38,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:32:38,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:38,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:38,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:38,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 18:32:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:32:38,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-23 18:32:38,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:38,210 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-23 18:32:38,358 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 18:32:38,359 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-23 18:32:38,385 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-23 18:32:38,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-23 18:32:38,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 18:32:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:38,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:32:38,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2024-11-23 18:32:38,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_75 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_75 .cse0))) v_ArrVal_75)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-23 18:32:38,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:38,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-11-23 18:32:38,887 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 58 treesize of output 54 [2024-11-23 18:32:39,022 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 143 treesize of output 137 [2024-11-23 18:32:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-23 18:32:39,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:32:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305555064] [2024-11-23 18:32:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305555064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:32:39,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:32:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-23 18:32:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329568400] [2024-11-23 18:32:39,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:32:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 18:32:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:32:39,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 18:32:39,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2024-11-23 18:32:39,352 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-23 18:32:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:32:39,954 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-23 18:32:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 18:32:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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 16 [2024-11-23 18:32:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:32:39,956 INFO L225 Difference]: With dead ends: 33 [2024-11-23 18:32:39,956 INFO L226 Difference]: Without dead ends: 31 [2024-11-23 18:32:39,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=138, Unknown=2, NotChecked=50, Total=240 [2024-11-23 18:32:39,957 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 18:32:39,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 53 Unchecked, 0.4s Time] [2024-11-23 18:32:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-23 18:32:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-23 18:32:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-23 18:32:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-23 18:32:39,967 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2024-11-23 18:32:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:32:39,968 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-23 18:32:39,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-23 18:32:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-23 18:32:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-23 18:32:39,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:39,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:39,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 18:32:40,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:40,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1135461913, now seen corresponding path program 1 times [2024-11-23 18:32:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158820327] [2024-11-23 18:32:40,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:32:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:40,173 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:40,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 18:32:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:32:40,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 18:32:40,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:40,331 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-23 18:32:40,514 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 18:32:40,515 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-23 18:32:40,653 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-23 18:32:40,679 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-23 18:32:40,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-23 18:32:40,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2024-11-23 18:32:40,876 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 11 [2024-11-23 18:32:40,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-23 18:32:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-23 18:32:41,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-23 18:32:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:41,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:32:41,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:41,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 89 [2024-11-23 18:32:41,411 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 14 treesize of output 3 [2024-11-23 18:32:41,418 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 111 treesize of output 100 [2024-11-23 18:32:41,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:41,668 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-23 18:32:41,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:41,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-23 18:32:41,739 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 7 treesize of output 3 [2024-11-23 18:32:41,754 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:32:41,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-23 18:32:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:42,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:32:42,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158820327] [2024-11-23 18:32:42,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158820327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:32:42,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:32:42,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-23 18:32:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100681257] [2024-11-23 18:32:42,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:32:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 18:32:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:32:42,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 18:32:42,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=170, Unknown=4, NotChecked=0, Total=210 [2024-11-23 18:32:42,120 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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-23 18:32:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:32:43,010 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-23 18:32:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 18:32:43,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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) Word has length 20 [2024-11-23 18:32:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:32:43,012 INFO L225 Difference]: With dead ends: 37 [2024-11-23 18:32:43,012 INFO L226 Difference]: Without dead ends: 35 [2024-11-23 18:32:43,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=301, Unknown=6, NotChecked=0, Total=380 [2024-11-23 18:32:43,014 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 18:32:43,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 18:32:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-23 18:32:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-23 18:32:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 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-23 18:32:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-23 18:32:43,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2024-11-23 18:32:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:32:43,023 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-23 18:32:43,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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-23 18:32:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-23 18:32:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-23 18:32:43,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:43,024 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:43,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 18:32:43,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:43,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 329835138, now seen corresponding path program 2 times [2024-11-23 18:32:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445523167] [2024-11-23 18:32:43,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:32:43,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:43,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:43,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 18:32:43,398 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:32:43,399 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:32:43,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 18:32:43,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:43,411 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-23 18:32:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 18:32:43,570 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-23 18:32:43,571 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 21 treesize of output 20 [2024-11-23 18:32:43,700 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 27 treesize of output 11 [2024-11-23 18:32:43,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 18:32:43,817 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 18:32:43,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-23 18:32:43,900 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 16 treesize of output 11 [2024-11-23 18:32:43,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 18:32:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:44,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:32:44,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-23 18:32:48,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_19| (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_161) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_163) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|))))) is different from false [2024-11-23 18:32:48,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|))) (not (= v_ArrVal_159 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_159 .cse0))))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_161) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_163) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-23 18:32:48,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:48,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 254 [2024-11-23 18:32:48,393 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 55 treesize of output 51 [2024-11-23 18:32:48,430 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-23 18:32:48,626 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-23 18:32:48,650 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 102 treesize of output 98 [2024-11-23 18:32:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-23 18:32:53,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:32:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445523167] [2024-11-23 18:32:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445523167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:32:53,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:32:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-11-23 18:32:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521344201] [2024-11-23 18:32:53,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:32:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 18:32:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:32:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 18:32:53,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=98, Unknown=8, NotChecked=66, Total=210 [2024-11-23 18:32:53,323 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-23 18:32:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:32:53,703 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-23 18:32:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 18:32:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 21 [2024-11-23 18:32:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:32:53,706 INFO L225 Difference]: With dead ends: 37 [2024-11-23 18:32:53,706 INFO L226 Difference]: Without dead ends: 35 [2024-11-23 18:32:53,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=50, Invalid=136, Unknown=8, NotChecked=78, Total=272 [2024-11-23 18:32:53,707 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:32:53,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2024-11-23 18:32:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-23 18:32:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-23 18:32:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 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-23 18:32:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-23 18:32:53,728 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2024-11-23 18:32:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:32:53,728 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-23 18:32:53,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-23 18:32:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-23 18:32:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-23 18:32:53,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:32:53,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:32:53,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 18:32:53,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:53,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:32:53,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:32:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1784775393, now seen corresponding path program 2 times [2024-11-23 18:32:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:32:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960747506] [2024-11-23 18:32:53,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 18:32:53,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:32:53,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:32:53,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:32:53,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 18:32:54,122 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 18:32:54,123 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:32:54,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-23 18:32:54,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:32:54,141 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-23 18:32:54,294 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-23 18:32:54,295 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-23 18:32:54,394 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-23 18:32:54,413 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-23 18:32:54,573 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-23 18:32:54,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-23 18:32:54,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-23 18:32:54,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-23 18:32:54,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-23 18:32:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:32:55,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:32:55,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,279 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-23 18:32:55,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,297 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-23 18:32:55,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,337 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-23 18:32:55,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,351 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-23 18:32:55,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,746 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 60 treesize of output 61 [2024-11-23 18:32:55,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,765 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 50 treesize of output 41 [2024-11-23 18:32:55,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,935 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2024-11-23 18:32:55,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:55,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 185 [2024-11-23 18:32:56,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:56,047 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 178 treesize of output 162 [2024-11-23 18:32:56,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:32:56,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 176 [2024-11-23 18:33:10,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:10,901 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 60 treesize of output 61 [2024-11-23 18:33:14,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:14,934 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 50 treesize of output 41 [2024-11-23 18:33:26,995 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 11 DAG size of output: 4 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-23 18:33:26,995 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-11-23 18:33:26,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2024-11-23 18:33:27,969 INFO L349 Elim1Store]: treesize reduction 97, result has 1.0 percent of original size [2024-11-23 18:33:27,970 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 1 [2024-11-23 18:33:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:33:28,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:33:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960747506] [2024-11-23 18:33:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960747506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:33:28,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:33:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-23 18:33:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691588380] [2024-11-23 18:33:28,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:33:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 18:33:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:33:28,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 18:33:28,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=169, Unknown=5, NotChecked=0, Total=210 [2024-11-23 18:33:28,603 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:33:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:33:29,266 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-23 18:33:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 18:33:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-23 18:33:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:33:29,268 INFO L225 Difference]: With dead ends: 45 [2024-11-23 18:33:29,268 INFO L226 Difference]: Without dead ends: 29 [2024-11-23 18:33:29,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=217, Unknown=5, NotChecked=0, Total=272 [2024-11-23 18:33:29,269 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 18:33:29,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 107 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 18:33:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-23 18:33:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-23 18:33:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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-23 18:33:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-23 18:33:29,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2024-11-23 18:33:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:33:29,273 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-23 18:33:29,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 18:33:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-23 18:33:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-23 18:33:29,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:33:29,274 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:33:29,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 18:33:29,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:33:29,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:33:29,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:33:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2139931384, now seen corresponding path program 3 times [2024-11-23 18:33:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:33:29,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629021802] [2024-11-23 18:33:29,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 18:33:29,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:33:29,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:33:29,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:33:29,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 18:33:30,496 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 18:33:30,496 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:33:30,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-23 18:33:30,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:33:30,509 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-23 18:33:30,651 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-23 18:33:30,651 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-23 18:33:30,786 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-23 18:33:30,795 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-23 18:33:30,955 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 18:33:30,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-23 18:33:31,001 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-23 18:33:31,002 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 35 treesize of output 26 [2024-11-23 18:33:31,045 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-23 18:33:31,045 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-23 18:33:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 18:33:31,281 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-23 18:33:31,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 89 [2024-11-23 18:33:31,317 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 39 treesize of output 15 [2024-11-23 18:33:31,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:33:31,345 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 27 treesize of output 22 [2024-11-23 18:33:31,777 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-23 18:33:31,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2024-11-23 18:33:31,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:33:31,814 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-23 18:33:31,849 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 16 treesize of output 15 [2024-11-23 18:33:31,892 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 16 treesize of output 15 [2024-11-23 18:33:31,924 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 36 treesize of output 15 [2024-11-23 18:33:32,309 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-23 18:33:32,310 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 88 treesize of output 46 [2024-11-23 18:33:32,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-23 18:33:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:33:32,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:33:32,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:32,688 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 74 treesize of output 72 [2024-11-23 18:33:32,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:32,701 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 64 treesize of output 62 [2024-11-23 18:33:34,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:34,514 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 197 treesize of output 191 [2024-11-23 18:33:34,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:34,859 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 930 treesize of output 961 [2024-11-23 18:33:34,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:34,903 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 584 treesize of output 548 [2024-11-23 18:33:34,924 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 539 treesize of output 503 [2024-11-23 18:33:34,958 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 503 treesize of output 467 [2024-11-23 18:33:35,758 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 21 treesize of output 3 [2024-11-23 18:33:37,037 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 160 treesize of output 142 [2024-11-23 18:33:37,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 3 [2024-11-23 18:33:37,096 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 21 treesize of output 3 [2024-11-23 18:33:37,169 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 379 treesize of output 325 [2024-11-23 18:33:37,209 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 21 treesize of output 3 [2024-11-23 18:33:37,302 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 160 treesize of output 142 [2024-11-23 18:33:37,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 3 [2024-11-23 18:33:37,373 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 21 treesize of output 3 [2024-11-23 18:33:37,461 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 21 treesize of output 3 [2024-11-23 18:33:37,521 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 358 treesize of output 322 [2024-11-23 18:33:37,703 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 358 treesize of output 322 [2024-11-23 18:33:38,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2024-11-23 18:33:38,327 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 358 treesize of output 322 [2024-11-23 18:33:38,413 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 21 treesize of output 3 [2024-11-23 18:33:38,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:38,648 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 726 treesize of output 757 [2024-11-23 18:33:42,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:33:42,117 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 726 treesize of output 757 [2024-11-23 18:33:48,580 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 8 treesize of output 4 [2024-11-23 18:33:49,012 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 8 treesize of output 4 [2024-11-23 18:33:49,518 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 8 treesize of output 4 [2024-11-23 18:33:50,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 8 treesize of output 4 [2024-11-23 18:33:50,076 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 8 treesize of output 4 [2024-11-23 18:33:50,107 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 8 treesize of output 4 [2024-11-23 18:33:50,268 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 8 treesize of output 4 [2024-11-23 18:33:52,465 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 49 treesize of output 37 [2024-11-23 18:33:53,988 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 84 treesize of output 64 [2024-11-23 18:33:56,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse1 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))) (not (= (select |c_#valid| .cse1) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse3 (select (select (store .cse4 .cse1 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse3) (= (select (select (store .cse4 .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse5 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse5) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse6 (select (select (store .cse8 .cse5 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse7 (select (select (store .cse8 .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6) (= .cse7 .cse6) (= .cse7 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse9) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse11 (select (select (store .cse10 .cse9 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse10 .cse9 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse11) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse11)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse12 (select (select (store .cse13 .cse9 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse12) (= (select (select (store .cse13 .cse9 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse13 .cse9 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse14) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse16 (select (select (store .cse15 .cse14 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse15 .cse14 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse16) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse16)))))) (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse17 (select (select (store .cse18 .cse14 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse17 (select (select (store .cse18 .cse14 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse19) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse20 .cse19 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse20 .cse19 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse22 (select (select (store .cse21 .cse19 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse23 (select (select (store .cse21 .cse19 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse21 .cse19 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse22) (= .cse23 .cse22) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse23)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse24) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse25 .cse24 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse25 .cse24 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse25 .cse24 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse27 (select (select (store .cse26 .cse24 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse26 .cse24 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse27) (not (= .cse27 .cse24))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse28) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse29 (select (select (store .cse30 .cse28 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse29) (= (select (select (store .cse30 .cse28 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse29))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse31 (select (select (store .cse32 .cse28 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse31) (= (select (select (store .cse32 .cse28 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (= (select (select (store .cse32 .cse28 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse33) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse34 (select (select (store .cse36 .cse33 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse35 (select (select (store .cse36 .cse33 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (= .cse35 .cse34) (= .cse35 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse37) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse37 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse39) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse40 (select (select (store .cse41 .cse39 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse40) (not (= .cse40 .cse0)) (= .cse40 (select (select (store .cse41 .cse39 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse39 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse42) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse43 (select (select (store .cse44 .cse42 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse43) (= (select (select (store .cse44 .cse42 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse43) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse42 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse45 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse45) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse46 (select (select (store .cse47 .cse45 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse46 (select (select (store .cse47 .cse45 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse46 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse48) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse48 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse49 .cse48)) (= .cse49 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store .cse50 .cse51 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse50 .cse51 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse50 .cse51 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))) (not (= (select |c_#valid| .cse51) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse51 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse51))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse52) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse54 (select (select (store .cse55 .cse52 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse53 (select (select (store .cse55 .cse52 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse53 .cse52)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54) (= .cse53 .cse54) (= .cse53 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse56 .cse57 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse56 .cse57 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse56 .cse57 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select |c_#valid| .cse57) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse59 (select (select (store .cse58 .cse57 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse58 .cse57 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse59) (not (= .cse59 .cse57))))))))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_113 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_176 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_113))) (= (_ bv0 32) .cse60)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse61) (_ bv0 1))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse62 .cse61 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse62 .cse61 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse62 .cse61 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse61 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse63) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse63 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse63 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse64) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse65) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse66 (select (select (store .cse67 .cse65 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse66 (select (select (store .cse67 .cse65 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse67 .cse65 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse67 .cse65 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse66))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse69 (select (select (store .cse68 .cse65 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse68 .cse65 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse69) (not (= .cse69 .cse65))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse70) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse70 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse70)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse70 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse71) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse72 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse72 .cse71 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse72 .cse71 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse73 (select (select (store .cse74 .cse71 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse73 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse73) (= .cse73 (select (select (store .cse74 .cse71 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse76 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse75 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse75 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse76 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse76) (_ bv0 1)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse77) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse78 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse78 .cse77 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse78 .cse77 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse77 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse79 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse79))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse80 (select (select (store .cse81 .cse82 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse80) (= (select (select (store .cse81 .cse82 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse80) (= .cse80 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse80 (select (select (store .cse81 .cse82 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (select |c_#valid| .cse82) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse82 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse83) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse83 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse83)))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store .cse84 .cse83 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse84 .cse83 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse84 .cse83 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse85 (select v_arrayElimArr_13 .cse0))) (let ((.cse86 (select (select (store .cse87 .cse85 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse85) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse85 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= (select (select (store .cse87 .cse85 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse86))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse88) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse88 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse89) (not (= .cse89 .cse0))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse88 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse90) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse90 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse91 .cse90)) (= .cse91 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse91 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse94 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store .cse93 .cse94 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse92 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse94 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse94) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse93 .cse94 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse95) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse96 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse96 .cse95 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse96 .cse95 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse99 (select (select (store .cse98 .cse95 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse97 (select (select (store .cse98 .cse95 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse97 (select (select (store .cse98 .cse95 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse99 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse99) (= .cse99 .cse97)))))))) (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse100 (select (select (store .cse101 v_arrayElimCell_114 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse100) (not (= (_ bv0 32) (select v_prenex_176 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_114))) (= .cse100 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse101 v_arrayElimCell_114 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse100))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse102) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse103 .cse102 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse103 .cse102 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse103 .cse102 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse105 (select (select (store .cse104 .cse102 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse104 .cse102 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse105) (not (= .cse105 .cse102))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse106) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse107 (select (select (store .cse108 .cse106 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse107 .cse106)) (= .cse107 (select (select (store .cse108 .cse106 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse107 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse109) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse109 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse109 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse110) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse111 (select (select (store .cse112 .cse110 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse111) (= (select (select (store .cse112 .cse110 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse111) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse113 (select (select (store .cse114 .cse110 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse113) (= (select (select (store .cse114 .cse110 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse113)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse115) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) (select (select (store .cse116 .cse115 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse116 .cse115 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse116 .cse115 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse117 (select (select (store .cse118 .cse115 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse117) (= (select (select (store .cse118 .cse115 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse117)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse119) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse120 (select (select (store .cse121 .cse119 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse120 (select (select (store .cse121 .cse119 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) .cse120) (= .cse120 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse121 .cse119 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse120))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse123 (select (select (store .cse122 .cse119 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse122 .cse119 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse123) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123))))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse124) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse124 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse124 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse125) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse127 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse126 (select (select (store .cse127 .cse125 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse126) (not (= .cse126 .cse0)) (= (select (select (store .cse127 .cse125 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse126))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse125 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse128) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse130 (select (select (store .cse132 .cse128 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse131 (select (select (store .cse132 .cse128 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse129 (select (select (store .cse132 .cse128 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse129 .cse130) (= .cse131 .cse130) (= .cse131 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse131) (= .cse131 .cse129))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse133 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse133 .cse128 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse133 .cse128 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse134 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse134) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse135 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse135 .cse134 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse135 .cse134 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse137 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse136 (select (select (store .cse137 .cse134 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse136 (select (select (store .cse137 .cse134 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse136 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse136)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse138) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse140 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse139 (select (select (store .cse140 .cse138 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse139 (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))) (= .cse139 (select (select (store .cse140 .cse138 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse138 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse141) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse143 (select (select (store .cse142 .cse141 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse142 .cse141 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse143) (not (= .cse143 .cse141)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse141 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse144 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse144) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse145 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse146 (select (select (store .cse145 .cse144 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse145 .cse144 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse146) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse146)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse147 (select (select (store .cse148 .cse144 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse147) (= .cse147 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse148 .cse144 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse147)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse149 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse149) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse151 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse150 (select (select (store .cse151 .cse149 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse150 (select (select (store .cse151 .cse149 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse150 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse150 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse152 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse152) (_ bv0 1))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse152 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse152 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse153) (= .cse153 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse154) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse155 (select (select (store .cse156 .cse154 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse155) (= .cse155 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse155 (select (select (store .cse156 .cse154 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse154 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse159 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse157 (select v_arrayElimArr_13 .cse0))) (let ((.cse158 (select (select (store .cse159 .cse157 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse157) (_ bv0 1))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse158) (= (select (select (store .cse159 .cse157 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse158) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse157 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse160) (= .cse160 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse162 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse161) (= .cse161 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select |c_#valid| .cse162) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse163 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse164 (select (select (store .cse163 .cse162 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse163 .cse162 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse164) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse164))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse166 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse165 (select (select (store .cse166 .cse167 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse165) (= (select (select (store .cse166 .cse167 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse165) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse167) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse169 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse168 (select (select (store .cse169 .cse167 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse168) (= (select (select (store .cse169 .cse167 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse168)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse170) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse171 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse172 (select (select (store .cse171 .cse170 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse171 .cse170 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse172) (= (select (select (store .cse171 .cse170 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse172) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse171 .cse170 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse174 (select (select (store .cse173 .cse170 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse173 .cse170 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse174) (not (= .cse174 .cse170))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse175 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse175) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse176 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse176 .cse175 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse176 .cse175 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse177 (select (select (store .cse178 .cse175 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse177 (select (select (store .cse178 .cse175 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse177 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse177) (= .cse177 (select (select (store .cse178 .cse175 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse179) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse182 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse181 (select (select (store .cse182 .cse179 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse180 (select (select (store .cse182 .cse179 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse180 .cse181) (= (_ bv0 32) .cse180) (= (select (select (store .cse182 .cse179 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse181) (= .cse180 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse184 (select (select (store .cse183 .cse179 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse183 .cse179 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse184) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse184))))))))))) is different from false [2024-11-23 18:34:01,821 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse1 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))) (not (= (select |c_#valid| .cse1) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse3 (select (select (store .cse4 .cse1 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse3) (= (select (select (store .cse4 .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse5 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse5) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse6 (select (select (store .cse8 .cse5 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse7 (select (select (store .cse8 .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6) (= .cse7 .cse6) (= .cse7 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse9) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse11 (select (select (store .cse10 .cse9 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse10 .cse9 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse11) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse11)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse12 (select (select (store .cse13 .cse9 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse12) (= (select (select (store .cse13 .cse9 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse13 .cse9 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse14) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse16 (select (select (store .cse15 .cse14 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse15 .cse14 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse16) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse16)))))) (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse17 (select (select (store .cse18 .cse14 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse17 (select (select (store .cse18 .cse14 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse19) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse20 .cse19 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse20 .cse19 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse22 (select (select (store .cse21 .cse19 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse23 (select (select (store .cse21 .cse19 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse21 .cse19 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse22) (= .cse23 .cse22) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse23)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse24) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse25 .cse24 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse25 .cse24 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse25 .cse24 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse27 (select (select (store .cse26 .cse24 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse26 .cse24 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse27) (not (= .cse27 .cse24))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse28) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse29 (select (select (store .cse30 .cse28 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse29) (= (select (select (store .cse30 .cse28 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse29))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse31 (select (select (store .cse32 .cse28 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse31) (= (select (select (store .cse32 .cse28 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (= (select (select (store .cse32 .cse28 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse33) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse34 (select (select (store .cse36 .cse33 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse35 (select (select (store .cse36 .cse33 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (= .cse35 .cse34) (= .cse35 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse37) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse37 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse39) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse40 (select (select (store .cse41 .cse39 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse40) (not (= .cse40 .cse0)) (= .cse40 (select (select (store .cse41 .cse39 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse39 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse42) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse43 (select (select (store .cse44 .cse42 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse43) (= (select (select (store .cse44 .cse42 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse43) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse42 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse45 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse45) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse46 (select (select (store .cse47 .cse45 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse46 (select (select (store .cse47 .cse45 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse46 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse48) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse48 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse49 .cse48)) (= .cse49 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store .cse50 .cse51 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse50 .cse51 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse50 .cse51 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))) (not (= (select |c_#valid| .cse51) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse51 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse51))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse52) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse54 (select (select (store .cse55 .cse52 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse53 (select (select (store .cse55 .cse52 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse53 .cse52)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54) (= .cse53 .cse54) (= .cse53 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse56 .cse57 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse56 .cse57 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse56 .cse57 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select |c_#valid| .cse57) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse59 (select (select (store .cse58 .cse57 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse58 .cse57 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse59) (not (= .cse59 .cse57))))))))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_113 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_176 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_113))) (= (_ bv0 32) .cse60)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse61) (_ bv0 1))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse62 .cse61 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse62 .cse61 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse62 .cse61 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse61 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse63) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse63 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse63 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse64) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse65) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse66 (select (select (store .cse67 .cse65 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse66 (select (select (store .cse67 .cse65 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse67 .cse65 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse67 .cse65 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse66))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse69 (select (select (store .cse68 .cse65 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse68 .cse65 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse69) (not (= .cse69 .cse65))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse70) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse70 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse70)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse70 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse71) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse72 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse72 .cse71 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse72 .cse71 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse73 (select (select (store .cse74 .cse71 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse73 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse73) (= .cse73 (select (select (store .cse74 .cse71 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse76 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse75 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse75 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse76 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse76) (_ bv0 1)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse77) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse78 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse78 .cse77 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse78 .cse77 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse77 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse79 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse79))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse80 (select (select (store .cse81 .cse82 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse80) (= (select (select (store .cse81 .cse82 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse80) (= .cse80 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse80 (select (select (store .cse81 .cse82 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (select |c_#valid| .cse82) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse82 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse83) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse83 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse83)))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store .cse84 .cse83 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse84 .cse83 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse84 .cse83 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse85 (select v_arrayElimArr_13 .cse0))) (let ((.cse86 (select (select (store .cse87 .cse85 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse85) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse85 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= (select (select (store .cse87 .cse85 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse86))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse88) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse88 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse89) (not (= .cse89 .cse0))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse88 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse90) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse90 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse91 .cse90)) (= .cse91 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse91 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse94 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store .cse93 .cse94 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse92 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse94 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse94) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse93 .cse94 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse95) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse96 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse96 .cse95 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse96 .cse95 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse99 (select (select (store .cse98 .cse95 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse97 (select (select (store .cse98 .cse95 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse97 (select (select (store .cse98 .cse95 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse99 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse99) (= .cse99 .cse97)))))))) (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse100 (select (select (store .cse101 v_arrayElimCell_114 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse100) (not (= (_ bv0 32) (select v_prenex_176 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_114))) (= .cse100 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse101 v_arrayElimCell_114 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse100))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse102) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse103 .cse102 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse103 .cse102 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse103 .cse102 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse105 (select (select (store .cse104 .cse102 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse104 .cse102 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse105) (not (= .cse105 .cse102))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse106) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse107 (select (select (store .cse108 .cse106 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse107 .cse106)) (= .cse107 (select (select (store .cse108 .cse106 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse107 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse109) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse109 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse109 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse110) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse111 (select (select (store .cse112 .cse110 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse111) (= (select (select (store .cse112 .cse110 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse111) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse113 (select (select (store .cse114 .cse110 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse113) (= (select (select (store .cse114 .cse110 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse113)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse115) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) (select (select (store .cse116 .cse115 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse116 .cse115 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse116 .cse115 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse117 (select (select (store .cse118 .cse115 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse117) (= (select (select (store .cse118 .cse115 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse117)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse119) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse120 (select (select (store .cse121 .cse119 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse120 (select (select (store .cse121 .cse119 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) .cse120) (= .cse120 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse121 .cse119 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse120))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse123 (select (select (store .cse122 .cse119 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse122 .cse119 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse123) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123))))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse124 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse124) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse124 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse124 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse125) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse127 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse126 (select (select (store .cse127 .cse125 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse126) (not (= .cse126 .cse0)) (= (select (select (store .cse127 .cse125 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse126))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse125 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse128) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse130 (select (select (store .cse132 .cse128 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse131 (select (select (store .cse132 .cse128 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse129 (select (select (store .cse132 .cse128 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse129 .cse130) (= .cse131 .cse130) (= .cse131 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse131) (= .cse131 .cse129))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse133 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse133 .cse128 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse133 .cse128 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse134 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse134) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse135 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse135 .cse134 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse135 .cse134 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse137 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse136 (select (select (store .cse137 .cse134 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse136 (select (select (store .cse137 .cse134 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse136 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse136)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse138) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse140 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse139 (select (select (store .cse140 .cse138 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse139 (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))) (= .cse139 (select (select (store .cse140 .cse138 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse138 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse141) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse143 (select (select (store .cse142 .cse141 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse142 .cse141 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse143) (not (= .cse143 .cse141)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse141 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse144 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse144) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse145 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse146 (select (select (store .cse145 .cse144 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse145 .cse144 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse146) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse146)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse147 (select (select (store .cse148 .cse144 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse147) (= .cse147 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse148 .cse144 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse147)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse149 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse149) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse151 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse150 (select (select (store .cse151 .cse149 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse150 (select (select (store .cse151 .cse149 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse150 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse150 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse152 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse152) (_ bv0 1))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse152 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse152 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse153) (= .cse153 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse154) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse155 (select (select (store .cse156 .cse154 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse155) (= .cse155 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse155 (select (select (store .cse156 .cse154 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse154 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse159 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse157 (select v_arrayElimArr_13 .cse0))) (let ((.cse158 (select (select (store .cse159 .cse157 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse157) (_ bv0 1))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse158) (= (select (select (store .cse159 .cse157 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse158) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse157 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse160) (= .cse160 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse162 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse161) (= .cse161 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select |c_#valid| .cse162) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse163 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse164 (select (select (store .cse163 .cse162 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse163 .cse162 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse164) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse164))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse166 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse165 (select (select (store .cse166 .cse167 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse165) (= (select (select (store .cse166 .cse167 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse165) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse167) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse169 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse168 (select (select (store .cse169 .cse167 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse168) (= (select (select (store .cse169 .cse167 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse168)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse170) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse171 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse172 (select (select (store .cse171 .cse170 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse171 .cse170 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse172) (= (select (select (store .cse171 .cse170 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse172) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse171 .cse170 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse174 (select (select (store .cse173 .cse170 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse173 .cse170 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse174) (not (= .cse174 .cse170))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse175 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse175) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse176 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse176 .cse175 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse176 .cse175 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse177 (select (select (store .cse178 .cse175 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse177 (select (select (store .cse178 .cse175 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse177 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse177) (= .cse177 (select (select (store .cse178 .cse175 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse179) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse182 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse181 (select (select (store .cse182 .cse179 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse180 (select (select (store .cse182 .cse179 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse180 .cse181) (= (_ bv0 32) .cse180) (= (select (select (store .cse182 .cse179 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse181) (= .cse180 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse184 (select (select (store .cse183 .cse179 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse183 .cse179 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse184) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse184))))))))))) is different from true [2024-11-23 18:35:09,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:09,719 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 29 treesize of output 30 [2024-11-23 18:35:09,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:09,882 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 29 treesize of output 30 [2024-11-23 18:35:10,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:10,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2024-11-23 18:35:10,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:10,981 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 38 treesize of output 38 [2024-11-23 18:35:11,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:11,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2024-11-23 18:35:12,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:12,143 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 137 treesize of output 113 [2024-11-23 18:35:12,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:12,544 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 35 treesize of output 33 [2024-11-23 18:35:12,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:12,956 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 56 treesize of output 54 [2024-11-23 18:35:19,214 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:19,214 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 114 treesize of output 1 [2024-11-23 18:35:19,344 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:19,344 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 224 treesize of output 1 [2024-11-23 18:35:19,476 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:19,476 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 85 treesize of output 1 [2024-11-23 18:35:19,609 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:19,609 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 85 treesize of output 1 [2024-11-23 18:35:19,741 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:19,742 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 85 treesize of output 1 [2024-11-23 18:35:19,876 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:19,876 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 85 treesize of output 1 [2024-11-23 18:35:20,013 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,014 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 169 treesize of output 1 [2024-11-23 18:35:20,147 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,147 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 114 treesize of output 1 [2024-11-23 18:35:20,274 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,274 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 85 treesize of output 1 [2024-11-23 18:35:20,405 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,406 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 140 treesize of output 1 [2024-11-23 18:35:20,527 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,528 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 148 treesize of output 1 [2024-11-23 18:35:20,661 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,661 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 85 treesize of output 1 [2024-11-23 18:35:20,791 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,791 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 114 treesize of output 1 [2024-11-23 18:35:20,916 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:20,917 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 1 [2024-11-23 18:35:21,048 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:21,049 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 85 treesize of output 1 [2024-11-23 18:35:21,178 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:21,179 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 85 treesize of output 1 [2024-11-23 18:35:21,312 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:21,312 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 29 treesize of output 1 [2024-11-23 18:35:21,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:21,539 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 29 treesize of output 30 [2024-11-23 18:35:21,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:21,735 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 29 treesize of output 30 [2024-11-23 18:35:22,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:22,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2024-11-23 18:35:22,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:35:23,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:23,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-23 18:35:23,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:23,508 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 38 treesize of output 38 [2024-11-23 18:35:23,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:23,895 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 79 treesize of output 71 [2024-11-23 18:35:24,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:24,273 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 35 treesize of output 33 [2024-11-23 18:35:27,113 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:27,113 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 114 treesize of output 1 [2024-11-23 18:35:27,250 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:27,250 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 140 treesize of output 1 [2024-11-23 18:35:27,385 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:27,385 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 169 treesize of output 1 [2024-11-23 18:35:27,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:27,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 59 treesize of output 49 [2024-11-23 18:35:27,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:27,737 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 30 treesize of output 31 [2024-11-23 18:35:28,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 298 [2024-11-23 18:35:28,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:28,860 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 67 treesize of output 63 [2024-11-23 18:35:29,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:35:29,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:29,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-11-23 18:35:29,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:29,917 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 61 [2024-11-23 18:35:30,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:30,308 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 131 treesize of output 115 [2024-11-23 18:35:33,381 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:33,381 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 29 treesize of output 1 [2024-11-23 18:35:33,510 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:33,510 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 114 treesize of output 1 [2024-11-23 18:35:33,637 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:33,638 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 114 treesize of output 1 [2024-11-23 18:35:33,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:33,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 62 treesize of output 52 [2024-11-23 18:35:33,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:33,968 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 30 treesize of output 31 [2024-11-23 18:35:34,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:34,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 167 [2024-11-23 18:35:35,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:35,018 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 158 treesize of output 148 [2024-11-23 18:35:35,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:35,392 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 115 treesize of output 111 [2024-11-23 18:35:35,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:35:35,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:35,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-11-23 18:35:36,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:36,431 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 160 treesize of output 128 [2024-11-23 18:35:39,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:39,652 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 94 treesize of output 74 [2024-11-23 18:35:39,910 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-23 18:35:39,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 520 treesize of output 478 [2024-11-23 18:35:40,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:40,218 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 220 treesize of output 172 [2024-11-23 18:35:40,428 INFO L224 Elim1Store]: Index analysis took 101 ms [2024-11-23 18:35:40,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:40,666 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 143 treesize of output 125 [2024-11-23 18:35:41,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:41,864 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 51 treesize of output 41 [2024-11-23 18:35:42,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:42,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 122 [2024-11-23 18:35:42,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:42,813 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 113 treesize of output 103 [2024-11-23 18:35:43,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:43,201 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 57 treesize of output 53 [2024-11-23 18:35:45,580 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:45,580 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 169 treesize of output 1 [2024-11-23 18:35:45,725 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:45,725 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 114 treesize of output 1 [2024-11-23 18:35:45,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:45,915 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 29 treesize of output 30 [2024-11-23 18:35:46,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:46,095 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 60 treesize of output 50 [2024-11-23 18:35:46,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:35:46,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:46,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-23 18:35:47,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:47,077 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 20 treesize of output 20 [2024-11-23 18:35:48,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:48,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 307 [2024-11-23 18:35:48,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:48,834 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 105 treesize of output 95 [2024-11-23 18:35:49,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:49,228 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 102 [2024-11-23 18:35:51,445 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:51,445 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 85 treesize of output 1 [2024-11-23 18:35:51,628 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:51,628 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 85 treesize of output 1 [2024-11-23 18:35:51,756 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:35:51,756 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 98 treesize of output 1 [2024-11-23 18:35:51,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:51,934 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 29 treesize of output 30 [2024-11-23 18:35:52,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:52,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-23 18:35:52,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:52,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2024-11-23 18:35:53,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:53,181 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 38 treesize of output 38 [2024-11-23 18:35:53,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:35:53,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:53,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-23 18:35:54,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:54,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 98 treesize of output 82 [2024-11-23 18:35:54,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:54,555 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 35 treesize of output 33 [2024-11-23 18:35:59,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:59,208 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 59 treesize of output 49 [2024-11-23 18:35:59,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:35:59,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2024-11-23 18:36:00,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:00,294 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 149 treesize of output 113 [2024-11-23 18:36:00,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:00,687 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 105 treesize of output 95 [2024-11-23 18:36:04,154 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:04,154 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 143 treesize of output 1 [2024-11-23 18:36:04,211 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 18:36:04,385 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:04,385 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 85 treesize of output 1 [2024-11-23 18:36:04,547 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:04,547 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 119 treesize of output 1 [2024-11-23 18:36:04,689 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:04,689 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 29 treesize of output 1 [2024-11-23 18:36:04,874 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:04,874 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 117 treesize of output 1 [2024-11-23 18:36:05,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:05,141 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 59 treesize of output 49 [2024-11-23 18:36:05,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:05,429 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 29 treesize of output 30 [2024-11-23 18:36:06,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:06,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 298 [2024-11-23 18:36:06,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:06,572 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 67 treesize of output 63 [2024-11-23 18:36:06,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 18:36:07,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:07,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-23 18:36:07,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:07,973 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 61 [2024-11-23 18:36:08,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:08,355 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 120 treesize of output 104 [2024-11-23 18:36:10,267 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:10,268 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 117 treesize of output 1 [2024-11-23 18:36:10,399 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:10,400 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 114 treesize of output 1 [2024-11-23 18:36:10,535 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:10,535 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 59 treesize of output 1 [2024-11-23 18:36:10,670 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:10,670 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 140 treesize of output 1 [2024-11-23 18:36:10,804 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:10,804 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 169 treesize of output 1 [2024-11-23 18:36:10,929 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:10,929 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 114 treesize of output 1 [2024-11-23 18:36:11,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:11,080 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 93 treesize of output 73 [2024-11-23 18:36:11,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:11,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 511 treesize of output 480 [2024-11-23 18:36:12,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:12,097 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 215 treesize of output 167 [2024-11-23 18:36:12,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:36:12,467 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 117 treesize of output 99 [2024-11-23 18:36:20,697 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:20,697 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 59 treesize of output 1 [2024-11-23 18:36:20,823 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:20,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 1 case distinctions, treesize of input 169 treesize of output 1 [2024-11-23 18:36:20,952 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-23 18:36:20,953 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 169 treesize of output 1 [2024-11-23 18:36:53,635 WARN L286 SmtUtils]: Spent 23.45s on a formula simplification. DAG size of input: 184 DAG size of output: 179 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 18:38:15,065 WARN L286 SmtUtils]: Spent 27.25s on a formula simplification that was a NOOP. DAG size: 308 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 18:39:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-23 18:39:27,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:39:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629021802] [2024-11-23 18:39:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629021802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 18:39:27,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:39:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-23 18:39:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072371329] [2024-11-23 18:39:27,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:39:27,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-23 18:39:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:39:27,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-23 18:39:27,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=308, Unknown=11, NotChecked=36, Total=420 [2024-11-23 18:39:27,509 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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-23 18:39:36,407 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse48 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse1 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))) (not (= (select |c_#valid| .cse1) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse3 (select (select (store .cse4 .cse1 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse3) (= (select (select (store .cse4 .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse5 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse5) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse6 (select (select (store .cse8 .cse5 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse7 (select (select (store .cse8 .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6) (= .cse7 .cse6) (= .cse7 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse9) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse11 (select (select (store .cse10 .cse9 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse10 .cse9 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse11) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse11)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse12 (select (select (store .cse13 .cse9 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse12) (= (select (select (store .cse13 .cse9 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse13 .cse9 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse14) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse16 (select (select (store .cse15 .cse14 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse15 .cse14 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse16) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse16)))))) (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse17 (select (select (store .cse18 .cse14 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse17 (select (select (store .cse18 .cse14 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse19) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse20 .cse19 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse20 .cse19 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse22 (select (select (store .cse21 .cse19 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse23 (select (select (store .cse21 .cse19 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse21 .cse19 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse22) (= .cse23 .cse22) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse23)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse24) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse25 .cse24 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse25 .cse24 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse25 .cse24 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse27 (select (select (store .cse26 .cse24 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse26 .cse24 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse27) (not (= .cse27 .cse24))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse28) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse29 (select (select (store .cse30 .cse28 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse29) (= (select (select (store .cse30 .cse28 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse29))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse31 (select (select (store .cse32 .cse28 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse31) (= (select (select (store .cse32 .cse28 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (= (select (select (store .cse32 .cse28 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse31) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse33) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse34 (select (select (store .cse36 .cse33 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse35 (select (select (store .cse36 .cse33 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (= .cse35 .cse34) (= .cse35 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse37) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse37 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse39) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse40 (select (select (store .cse41 .cse39 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse40) (not (= .cse40 .cse0)) (= .cse40 (select (select (store .cse41 .cse39 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse39 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse42) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse43 (select (select (store .cse44 .cse42 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse43) (= (select (select (store .cse44 .cse42 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse43) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse42 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse45 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse45) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse46 (select (select (store .cse47 .cse45 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse46 (select (select (store .cse47 .cse45 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse46 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse48))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse49) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse49 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse50 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse50 .cse49)) (= .cse50 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store .cse51 .cse52 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse51 .cse52 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse51 .cse52 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))) (not (= (select |c_#valid| .cse52) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse52 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse52))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse53) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse55 (select (select (store .cse56 .cse53 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse54 (select (select (store .cse56 .cse53 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse54 .cse53)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse55) (= .cse54 .cse55) (= .cse54 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse57 .cse58 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse57 .cse58 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse57 .cse58 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select |c_#valid| .cse58) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse60 (select (select (store .cse59 .cse58 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse59 .cse58 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse60) (not (= .cse60 .cse58))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse48) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) v_arrayElimCell_113 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse61 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_176 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_113))) (= (_ bv0 32) .cse61)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse62) (_ bv0 1))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse63 .cse62 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))) (= (select (select (store .cse63 .cse62 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse63 .cse62 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse62 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse64) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse64 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse64 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse65) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse66) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse67 (select (select (store .cse68 .cse66 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse67 (select (select (store .cse68 .cse66 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse68 .cse66 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse68 .cse66 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse67))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse70 (select (select (store .cse69 .cse66 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse69 .cse66 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse70) (not (= .cse70 .cse66))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse71) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse71 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse71)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse71 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse72) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse73 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse73 .cse72 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse73 .cse72 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse74 (select (select (store .cse75 .cse72 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse74 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse74) (= .cse74 (select (select (store .cse75 .cse72 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse77 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse76 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse76 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse77 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse77) (_ bv0 1)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse78) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse79 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse79 .cse78 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse79 .cse78 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse78 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse80 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse80))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse81 (select (select (store .cse82 .cse83 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse81) (= (select (select (store .cse82 .cse83 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse81) (= .cse81 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse81 (select (select (store .cse82 .cse83 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (select |c_#valid| .cse83) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse83 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse84) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse84 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse84)))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_175 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_175 (_ bv4 32)))) (= (select (select (store .cse85 .cse84 v_prenex_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store .cse85 .cse84 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse85 .cse84 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse86 (select v_arrayElimArr_13 .cse0))) (let ((.cse87 (select (select (store .cse88 .cse86 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse86) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse86 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87) (= (select (select (store .cse88 .cse86 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse87))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse89) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse89 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse90) (not (= .cse90 .cse0))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse89 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse91) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse91 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse92 .cse91)) (= .cse92 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse95 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (select (select (store .cse94 .cse95 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse93 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse93 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse95 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select |c_#valid| .cse95) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse94 .cse95 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse96) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse97 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse97 .cse96 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse97 .cse96 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse100 (select (select (store .cse99 .cse96 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse98 (select (select (store .cse99 .cse96 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse98 (select (select (store .cse99 .cse96 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse100 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse100) (= .cse100 .cse98)))))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (forall ((v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse101 (select (select (store .cse102 v_arrayElimCell_114 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse101) (not (= (_ bv0 32) (select v_prenex_176 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_114))) (= .cse101 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse102 v_arrayElimCell_114 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse101))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse103) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse104 .cse103 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse104 .cse103 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse104 .cse103 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse106 (select (select (store .cse105 .cse103 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse105 .cse103 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse106) (not (= .cse106 .cse103))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse107) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse108 (select (select (store .cse109 .cse107 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse108 .cse107)) (= .cse108 (select (select (store .cse109 .cse107 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse108 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse110) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse110 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse110 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse111) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse112 (select (select (store .cse113 .cse111 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse112) (= (select (select (store .cse113 .cse111 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse112) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse114 (select (select (store .cse115 .cse111 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse114) (= (select (select (store .cse115 .cse111 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse114)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse116) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) (select (select (store .cse117 .cse116 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (select (select (store .cse117 .cse116 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse117 .cse116 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse118 (select (select (store .cse119 .cse116 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (= (select (select (store .cse119 .cse116 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse118)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse120) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse121 (select (select (store .cse122 .cse120 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse121 (select (select (store .cse122 .cse120 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= (_ bv0 32) .cse121) (= .cse121 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse122 .cse120 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse121))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse124 (select (select (store .cse123 .cse120 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse123 .cse120 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse124) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124))))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse125) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse125 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse125 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse126 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse126) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse127 (select (select (store .cse128 .cse126 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse127) (not (= .cse127 .cse0)) (= (select (select (store .cse128 .cse126 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse127))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse126 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse129 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse129) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse131 (select (select (store .cse133 .cse129 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse132 (select (select (store .cse133 .cse129 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse130 (select (select (store .cse133 .cse129 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse130 .cse131) (= .cse132 .cse131) (= .cse132 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse132) (= .cse132 .cse130))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse134 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse134 .cse129 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse134 .cse129 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse135 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse135) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse136 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse136 .cse135 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse136 .cse135 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse137 (select (select (store .cse138 .cse135 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse137 (select (select (store .cse138 .cse135 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse137 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse137)))))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse48)) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse139 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse139) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_174 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse140 (select (select (store .cse141 .cse139 v_prenex_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse140 (_ bv0 32)) (not (= (select v_prenex_174 (_ bv4 32)) (_ bv0 32))) (= .cse140 (select (select (store .cse141 .cse139 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse139 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse142) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse144 (select (select (store .cse143 .cse142 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse143 .cse142 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse144) (not (= .cse144 .cse142)))))) (forall ((v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse142 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse145 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse145) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse146 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse147 (select (select (store .cse146 .cse145 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse146 .cse145 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse147) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse147)))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse149 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse148 (select (select (store .cse149 .cse145 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse148) (= .cse148 |c_ULTIMATE.start_main_~p~0#1.offset|) (= (select (select (store .cse149 .cse145 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse148)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse150) (_ bv0 1))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse152 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse151 (select (select (store .cse152 .cse150 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse151 (select (select (store .cse152 .cse150 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse151 (_ bv0 32)) (not (= (_ bv0 32) (select v_prenex_8 (_ bv4 32)))) (= .cse151 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse153) (_ bv0 1))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse153 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse153 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse154) (= .cse154 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse155 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse155) (_ bv0 1))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_prenex_176 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse157 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse156 (select (select (store .cse157 .cse155 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse156) (= .cse156 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse156 (select (select (store .cse157 .cse155 v_prenex_176) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse155 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13)) (.cse158 (select v_arrayElimArr_13 .cse0))) (let ((.cse159 (select (select (store .cse160 .cse158 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse158) (_ bv0 1))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse159) (= (select (select (store .cse160 .cse158 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse159) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse158 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse161) (= .cse161 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse163 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse163 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse162) (= .cse162 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select |c_#valid| .cse163) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse165 (select (select (store .cse164 .cse163 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse164 .cse163 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse165) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse165))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse168 (select v_arrayElimArr_13 .cse0))) (or (forall ((v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse166 (select (select (store .cse167 .cse168 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (_ bv0 32) .cse166) (= (select (select (store .cse167 .cse168 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse166) (not (= (_ bv0 32) (select v_prenex_233 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse168) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse169 (select (select (store .cse170 .cse168 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (= (select (select (store .cse170 .cse168 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse169)))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse171 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse171) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse172 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse173 (select (select (store .cse172 .cse171 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= (select (select (store .cse172 .cse171 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse173) (= (select (select (store .cse172 .cse171 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse173) (not (= (_ bv0 32) (select v_prenex_234 (_ bv4 32)))) (= (_ bv0 32) (select (select (store .cse172 .cse171 v_prenex_234) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse174 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse175 (select (select (store .cse174 .cse171 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse174 .cse171 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse175) (not (= .cse175 .cse171))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse176 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse176) (_ bv0 1))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (let ((.cse177 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (= (select (select (store .cse177 .cse176 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (select (select (store .cse177 .cse176 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse178 (select (select (store .cse179 .cse176 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse178 (select (select (store .cse179 .cse176 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse178 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_prenex_235 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse178) (= .cse178 (select (select (store .cse179 .cse176 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse180 (select v_arrayElimArr_13 .cse0))) (or (not (= (select |c_#valid| .cse180) (_ bv0 1))) (forall ((v_prenex_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse182 (select (select (store .cse183 .cse180 v_prenex_233) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse181 (select (select (store .cse183 .cse180 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_14 .cse0))) (= .cse181 .cse182) (= (_ bv0 32) .cse181) (= (select (select (store .cse183 .cse180 v_prenex_235) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse182) (= .cse181 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse184 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13))) (let ((.cse185 (select (select (store .cse184 .cse180 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_11 (_ bv4 32)))) (= (select (select (store .cse184 .cse180 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse185) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse185))))))))))) is different from true [2024-11-23 18:39:42,813 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-23 18:39:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:39:50,116 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-23 18:39:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 18:39:50,117 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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 25 [2024-11-23 18:39:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:39:50,117 INFO L225 Difference]: With dead ends: 45 [2024-11-23 18:39:50,117 INFO L226 Difference]: Without dead ends: 43 [2024-11-23 18:39:50,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 91.5s TimeCoverageRelationStatistics Valid=93, Invalid=409, Unknown=12, NotChecked=86, Total=600 [2024-11-23 18:39:50,119 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-23 18:39:50,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 89 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 90 Unchecked, 13.6s Time] [2024-11-23 18:39:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-23 18:39:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-23 18:39:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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-23 18:39:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-23 18:39:50,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2024-11-23 18:39:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:39:50,136 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-23 18:39:50,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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-23 18:39:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-23 18:39:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 18:39:50,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:39:50,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:39:50,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-23 18:39:50,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:50,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:39:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:39:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1944118414, now seen corresponding path program 4 times [2024-11-23 18:39:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:39:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896001740] [2024-11-23 18:39:50,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 18:39:50,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:39:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:39:50,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:39:50,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff869500-4325-41e4-96b8-c0c1dafaeca1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 18:39:50,478 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 18:39:50,478 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 18:39:50,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-23 18:39:50,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:39:50,591 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-23 18:39:54,294 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-23 18:39:54,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 19 treesize of output 27 [2024-11-23 18:39:57,001 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-23 18:39:57,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 18:40:01,141 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 18:40:01,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-23 18:40:01,668 INFO L224 Elim1Store]: Index analysis took 123 ms [2024-11-23 18:40:02,184 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-23 18:40:02,185 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 35 treesize of output 26 [2024-11-23 18:40:03,213 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-23 18:40:03,213 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-23 18:40:06,699 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-23 18:40:06,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 67 [2024-11-23 18:40:07,110 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 27 treesize of output 22 [2024-11-23 18:40:11,924 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-23 18:40:11,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 87 [2024-11-23 18:40:12,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-11-23 18:40:12,696 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 16 treesize of output 15 [2024-11-23 18:40:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:40:13,038 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-23 18:40:13,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 16 treesize of output 15 [2024-11-23 18:40:26,670 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-23 18:40:26,670 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 76 treesize of output 50 [2024-11-23 18:40:26,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-23 18:40:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 18:40:29,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:40:36,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:36,887 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 130 treesize of output 118 [2024-11-23 18:40:37,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:37,103 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 110 treesize of output 98 [2024-11-23 18:40:37,417 INFO L224 Elim1Store]: Index analysis took 103 ms [2024-11-23 18:40:37,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:37,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 179 [2024-11-23 18:40:38,021 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 32 treesize of output 3 [2024-11-23 18:40:38,443 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 237 treesize of output 208 [2024-11-23 18:40:41,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_76 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_76 .cse0))) (forall ((v_arrayElimArr_75 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_75))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse1 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_75 .cse0))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select .cse2 .cse1) (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_76) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv4 32)))))))))) (forall ((v_arrayElimArr_76 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_76))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (forall ((v_arrayElimArr_75 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_75 .cse0))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select .cse4 (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_75) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (bvadd .cse5 (_ bv4 32)))))) (not (= (_ bv0 32) (select v_arrayElimArr_76 .cse0))) (= .cse5 (_ bv0 32)))))) (forall ((v_arrayElimArr_76 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_76) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_76 .cse0))) (= .cse6 (_ bv0 32)) (forall ((v_arrayElimArr_75 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_75 .cse0))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_75))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (bvadd .cse6 (_ bv4 32))))))))) (forall ((v_arrayElimArr_76 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_75 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_75) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse8 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_75 .cse0))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (let ((.cse9 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_76))) (select (select .cse9 .cse8) (bvadd (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv4 32)))))))) (not (= (_ bv0 32) (select v_arrayElimArr_76 .cse0))))))) is different from false [2024-11-23 18:40:53,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:53,111 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 349 treesize of output 318 [2024-11-23 18:40:53,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:40:53,372 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 381 treesize of output 350 [2024-11-23 18:41:13,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:13,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 105 [2024-11-23 18:41:13,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:13,927 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-23 18:41:14,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:14,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 298 [2024-11-23 18:41:15,699 INFO L224 Elim1Store]: Index analysis took 921 ms [2024-11-23 18:41:50,284 WARN L286 SmtUtils]: Spent 33.86s on a formula simplification. DAG size of input: 213 DAG size of output: 159 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-23 18:41:50,285 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2024-11-23 18:41:50,285 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 12 new quantified variables, introduced 55 case distinctions, treesize of input 2888 treesize of output 3071 [2024-11-23 18:41:50,700 INFO L224 Elim1Store]: Index analysis took 107 ms [2024-11-23 18:41:51,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:51,104 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 763 treesize of output 689 [2024-11-23 18:41:52,429 INFO L224 Elim1Store]: Index analysis took 1113 ms [2024-11-23 18:41:55,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:55,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 727 treesize of output 567 [2024-11-23 18:41:55,943 INFO L224 Elim1Store]: Index analysis took 102 ms [2024-11-23 18:41:56,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 18:41:56,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 397 treesize of output 325 [2024-11-23 18:41:57,527 INFO L224 Elim1Store]: Index analysis took 969 ms [2024-11-23 18:42:03,364 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-23 18:42:03,364 INFO L349 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2024-11-23 18:42:03,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 446 treesize of output 388